Base | Representation |
---|---|
bin | 11101110001111000011… |
… | …00001001010010111001 |
3 | 10121211002101221212221201 |
4 | 32320330030021102321 |
5 | 113231014240030314 |
6 | 2102020200534201 |
7 | 133632101531152 |
oct | 16707414112271 |
9 | 3554071855851 |
10 | 1023212033209 |
11 | 364a3a577013 |
12 | 14637b781361 |
13 | 75647266132 |
14 | 3774916a929 |
15 | 1b9394aab74 |
hex | ee3c3094b9 |
1023212033209 has 2 divisors, whose sum is σ = 1023212033210. Its totient is φ = 1023212033208.
The previous prime is 1023212033191. The next prime is 1023212033237. The reversal of 1023212033209 is 9023302123201.
1023212033209 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (1023212033237) can be obtained adding 1023212033209 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 712584157609 + 310627875600 = 844147^2 + 557340^2 .
It is a cyclic number.
It is not a de Polignac number, because 1023212033209 - 211 = 1023212031161 is a prime.
It is not a weakly prime, because it can be changed into another prime (1023212033609) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511606016604 + 511606016605.
It is an arithmetic number, because the mean of its divisors is an integer number (511606016605).
Almost surely, 21023212033209 is an apocalyptic number.
It is an amenable number.
1023212033209 is a deficient number, since it is larger than the sum of its proper divisors (1).
1023212033209 is an equidigital number, since it uses as much as digits as its factorization.
1023212033209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 1023212033209 in words is "one trillion, twenty-three billion, two hundred twelve million, thirty-three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •