Base | Representation |
---|---|
bin | 1011000110110010010011… |
… | …0101011100011001000101 |
3 | 1121020101021012222102010222 |
4 | 2301230210311130121011 |
5 | 3100032024230342404 |
6 | 41545430305354125 |
7 | 2400142111336634 |
oct | 261544465343105 |
9 | 47211235872128 |
10 | 12211210012229 |
11 | 3988821785118 |
12 | 1452745638945 |
13 | 6a76872b7997 |
14 | 3030507db51b |
15 | 1629955b9dbe |
hex | b1b24d5c645 |
12211210012229 has 2 divisors, whose sum is σ = 12211210012230. Its totient is φ = 12211210012228.
The previous prime is 12211210012109. The next prime is 12211210012241. The reversal of 12211210012229 is 92221001211221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11705259477025 + 505950535204 = 3421295^2 + 711302^2 .
It is a cyclic number.
It is not a de Polignac number, because 12211210012229 - 236 = 12142490535493 is a prime.
It is a super-2 number, since 2×122112100122292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12211210012198 and 12211210012207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12211210011229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105605006114 + 6105605006115.
It is an arithmetic number, because the mean of its divisors is an integer number (6105605006115).
Almost surely, 212211210012229 is an apocalyptic number.
It is an amenable number.
12211210012229 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211210012229 is an equidigital number, since it uses as much as digits as its factorization.
12211210012229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 12211210012229 in words is "twelve trillion, two hundred eleven billion, two hundred ten million, twelve thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •