Base | Representation |
---|---|
bin | 1010111011101110001010… |
… | …0101100110100010110011 |
3 | 1120120012121112002101021011 |
4 | 2232323202211212202303 |
5 | 3033423223210032402 |
6 | 41322232025011351 |
7 | 2350332363041020 |
oct | 256734245464263 |
9 | 46505545071234 |
10 | 12021120002227 |
11 | 39151459400a6 |
12 | 1421934923b57 |
13 | 69278212c61b |
14 | 2d7b7a92c547 |
15 | 15ca6c173ed7 |
hex | aeee29668b3 |
12021120002227 has 32 divisors (see below), whose sum is σ = 14492776826880. Its totient is φ = 9740409045120.
The previous prime is 12021120002219. The next prime is 12021120002299. The reversal of 12021120002227 is 72220002112021.
It is a cyclic number.
It is not a de Polignac number, because 12021120002227 - 23 = 12021120002219 is a prime.
It is a super-2 number, since 2×120211200022272 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12021120002198 and 12021120002207.
It is not an unprimeable number, because it can be changed into a prime (12021120002327) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 245119353 + ... + 245168389.
It is an arithmetic number, because the mean of its divisors is an integer number (452899275840).
Almost surely, 212021120002227 is an apocalyptic number.
12021120002227 is a deficient number, since it is larger than the sum of its proper divisors (2471656824653).
12021120002227 is a wasteful number, since it uses less digits than its factorization.
12021120002227 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53011.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 12021120002227 its reverse (72220002112021), we get a palindrome (84241122114248).
The spelling of 12021120002227 in words is "twelve trillion, twenty-one billion, one hundred twenty million, two thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •