Base | Representation |
---|---|
bin | 1010111011001100111100… |
… | …0010111011001011110101 |
3 | 1120112100121000200121011112 |
4 | 2232303033002323023311 |
5 | 3033301442231210122 |
6 | 41314155101444405 |
7 | 2346565366046621 |
oct | 256631702731365 |
9 | 46470530617145 |
10 | 12012202210037 |
11 | 3911389a98907 |
12 | 1420066270705 |
13 | 691990703603 |
14 | 2d75723d6181 |
15 | 15c6e92d52e2 |
hex | aeccf0bb2f5 |
12012202210037 has 2 divisors, whose sum is σ = 12012202210038. Its totient is φ = 12012202210036.
The previous prime is 12012202210013. The next prime is 12012202210121. The reversal of 12012202210037 is 73001220221021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9153039109201 + 2859163100836 = 3025399^2 + 1690906^2 .
It is a cyclic number.
It is not a de Polignac number, because 12012202210037 - 222 = 12012198015733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12012202209994 and 12012202210021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12012202210537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6006101105018 + 6006101105019.
It is an arithmetic number, because the mean of its divisors is an integer number (6006101105019).
Almost surely, 212012202210037 is an apocalyptic number.
It is an amenable number.
12012202210037 is a deficient number, since it is larger than the sum of its proper divisors (1).
12012202210037 is an equidigital number, since it uses as much as digits as its factorization.
12012202210037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 12012202210037 its reverse (73001220221021), we get a palindrome (85013422431058).
The spelling of 12012202210037 in words is "twelve trillion, twelve billion, two hundred two million, two hundred ten thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •