Base | Representation |
---|---|
bin | 1010111011110010001110… |
… | …1000010001101000001101 |
3 | 1120120022102120102002102101 |
4 | 2232330203220101220031 |
5 | 3033432442033101104 |
6 | 41322532205355101 |
7 | 2350401413204611 |
oct | 256744350215015 |
9 | 46508376362371 |
10 | 12022211222029 |
11 | 39156558a8748 |
12 | 1421b9a268a91 |
13 | 6928c7227a08 |
14 | 2d7c41823341 |
15 | 15cad2d735a4 |
hex | aef23a11a0d |
12022211222029 has 2 divisors, whose sum is σ = 12022211222030. Its totient is φ = 12022211222028.
The previous prime is 12022211221967. The next prime is 12022211222033. The reversal of 12022211222029 is 92022211222021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9765687500100 + 2256523721929 = 3125010^2 + 1502173^2 .
It is an emirp because it is prime and its reverse (92022211222021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12022211222029 - 27 = 12022211221901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12022211221988 and 12022211222006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12022211222039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6011105611014 + 6011105611015.
It is an arithmetic number, because the mean of its divisors is an integer number (6011105611015).
Almost surely, 212022211222029 is an apocalyptic number.
It is an amenable number.
12022211222029 is a deficient number, since it is larger than the sum of its proper divisors (1).
12022211222029 is an equidigital number, since it uses as much as digits as its factorization.
12022211222029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
The spelling of 12022211222029 in words is "twelve trillion, twenty-two billion, two hundred eleven million, two hundred twenty-two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •