Base | Representation |
---|---|
bin | 1001000110101110010101… |
… | …0100101111111001011001 |
3 | 1022110001110020202211022012 |
4 | 2101223211110233321121 |
5 | 2303010234013034314 |
6 | 33143013503235305 |
7 | 2052164626225613 |
oct | 221534524577131 |
9 | 38401406684265 |
10 | 10011121221209 |
11 | 320a768a38129 |
12 | 11582802a8b35 |
13 | 5780772168a4 |
14 | 268780155db3 |
15 | 12562b47993e |
hex | 91ae552fe59 |
10011121221209 has 2 divisors, whose sum is σ = 10011121221210. Its totient is φ = 10011121221208.
The previous prime is 10011121221181. The next prime is 10011121221239. The reversal of 10011121221209 is 90212212111001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9973298750809 + 37822470400 = 3158053^2 + 194480^2 .
It is an emirp because it is prime and its reverse (90212212111001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10011121221209 - 232 = 10006826253913 is a prime.
It is a super-2 number, since 2×100111212212092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10011121221239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005560610604 + 5005560610605.
It is an arithmetic number, because the mean of its divisors is an integer number (5005560610605).
Almost surely, 210011121221209 is an apocalyptic number.
It is an amenable number.
10011121221209 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011121221209 is an equidigital number, since it uses as much as digits as its factorization.
10011121221209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 10011121221209 in words is "ten trillion, eleven billion, one hundred twenty-one million, two hundred twenty-one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •