Base | Representation |
---|---|
bin | 1010000000010011000000… |
… | …1101100101010010001001 |
3 | 1102221121111020211112020001 |
4 | 2200010300031211102021 |
5 | 2420211422322041014 |
6 | 35221233101203001 |
7 | 2213511465124312 |
oct | 240046015452211 |
9 | 42847436745201 |
10 | 11000220112009 |
11 | 3561192529367 |
12 | 1297abb560461 |
13 | 61a415c0074b |
14 | 2a05b08b1609 |
15 | 14121ab87974 |
hex | a0130365489 |
11000220112009 has 2 divisors, whose sum is σ = 11000220112010. Its totient is φ = 11000220112008.
The previous prime is 11000220111917. The next prime is 11000220112031. The reversal of 11000220112009 is 90021102200011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10575894243600 + 424325868409 = 3252060^2 + 651403^2 .
It is a cyclic number.
It is not a de Polignac number, because 11000220112009 - 211 = 11000220109961 is a prime.
It is not a weakly prime, because it can be changed into another prime (11000220116009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500110056004 + 5500110056005.
It is an arithmetic number, because the mean of its divisors is an integer number (5500110056005).
Almost surely, 211000220112009 is an apocalyptic number.
It is an amenable number.
11000220112009 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000220112009 is an equidigital number, since it uses as much as digits as its factorization.
11000220112009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 11000220112009 in words is "eleven trillion, two hundred twenty million, one hundred twelve thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •