Base | Representation |
---|---|
bin | 11101001000100010111… |
… | …00010000101110111001 |
3 | 10112200210210201212002121 |
4 | 32210101130100232321 |
5 | 112400042110014314 |
6 | 2043510124401241 |
7 | 132215131422334 |
oct | 16442134205671 |
9 | 3480723655077 |
10 | 1001020001209 |
11 | 35659176a9a8 |
12 | 1420076a6221 |
13 | 7351b6b9857 |
14 | 36641abd61b |
15 | 1b08b098d24 |
hex | e911710bb9 |
1001020001209 has 2 divisors, whose sum is σ = 1001020001210. Its totient is φ = 1001020001208.
The previous prime is 1001020001171. The next prime is 1001020001213. The reversal of 1001020001209 is 9021000201001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 664681478400 + 336338522809 = 815280^2 + 579947^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001020001209 - 29 = 1001020000697 is a prime.
It is a super-2 number, since 2×10010200012092 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1001020001192 and 1001020001201.
It is not a weakly prime, because it can be changed into another prime (1001020001239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500510000604 + 500510000605.
It is an arithmetic number, because the mean of its divisors is an integer number (500510000605).
Almost surely, 21001020001209 is an apocalyptic number.
It is an amenable number.
1001020001209 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001020001209 is an equidigital number, since it uses as much as digits as its factorization.
1001020001209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
The spelling of 1001020001209 in words is "one trillion, one billion, twenty million, one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •