// Workers AI · dad joke modeIs 294,001 odd? No, it's even bigger.
| ||||
|---|---|---|---|---|
| Cardinal | two hundred ninety-four thousand one | |||
| Ordinal | 294001st (two hundred ninety-four thousand first) | |||
| Factorization | prime | |||
| Divisors | 1, 294001 | |||
| Greek numeral | ͵δα´ | |||
| Roman numeral | CCXCIVI, ccxcivi | |||
| Binary | 10001111100011100012 | |||
| Ternary | 1122210212213 | |||
| Senary | 101450416 | |||
| Octal | 10761618 | |||
| Duodecimal | 12218112 | |||
| Hexadecimal | 47C7116 | |||
294,001 (two hundred ninety-four thousand [and] one) is the natural number following 294,000 and preceding 294,002.
In mathematics
[edit]294,001 has only two divisors, meaning that it is the 25532nd prime number. It is also a twin prime.[1]
Delicate Prime
[edit]294,001 is most notable for being a delicate prime in base 10,[a] which is also the first one.[2][3][4][5] Since changing the number 1 in 294,001 to 7, the resulting number is divisible by 7; changing it to a 9, it becomes divisible by 3, all which are composite.[6][4]
For every , each of the numbers and , is either equal to 294001 or composite.[7][8]
Notes
[edit]- ↑ Also known as a weakly prime
References
[edit]- ↑ Vanovschi, Vitalii. "Properties of the number 294001". www.numberempire.com. Retrieved 2026-09-14.
- ↑ Stamm, Emily (2020). "AN INVESTIGATION OF (NEARLY) WEAKLY PRIMES AND RELATED SIEVE FORMULATIONS" (PDF). Unpublished. doi:10.13140/RG.2.2.24482.86723.
{{cite journal}}: Cite journal requires|journal=(help) - ↑ Sloane, N. J. A. (ed.). "Sequence A050249 (Weakly prime numbers (changing any one decimal digit always produces a composite number). Also called digitally delicate primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 Weisstein, Eric W. "Weakly Prime". mathworld.wolfram.com. Wolfram Research, Inc. Retrieved 2026-09-14.
- ↑ "Puzzle 17.- Weakly Primes". www.primepuzzles.net. Retrieved 2026-09-14.
- ↑ Nadis, Steve (2021-03-30). "Mathematicians Find a New Class of Digitally Delicate Primes". Quanta Magazine. Retrieved 2026-09-14.
- ↑ Landman, Bruce M.; Luca, Florian; Nathanson, Melvyn B.; Nešetřil, Jaroslav; Robertson, Aaron (2022-04-19). Number Theory and Combinatorics: A Collection in Honor of the Mathematics of Ronald Graham. Walter de Gruyter GmbH & Co KG. ISBN 978-3-11-075421-6.
- ↑ Luckner, Thomas. "Research Statement" (PDF). people.math.sc.edu. Retrieved 2026-09-14.