Base | Representation |
---|---|
bin | 1010001100101001000100… |
… | …1011011010010010010001 |
3 | 1110200212220111011212122101 |
4 | 2203022101023122102101 |
5 | 2432200242341031004 |
6 | 35502505404240401 |
7 | 2235030153210163 |
oct | 243122113322221 |
9 | 43625814155571 |
10 | 11212300330129 |
11 | 36331232611a8 |
12 | 1311028840101 |
13 | 634413b8cb82 |
14 | 2aa96d0d2933 |
15 | 1469ce925ba4 |
hex | a32912da491 |
11212300330129 has 2 divisors, whose sum is σ = 11212300330130. Its totient is φ = 11212300330128.
The previous prime is 11212300330103. The next prime is 11212300330139. The reversal of 11212300330129 is 92103300321211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10256794080129 + 955506250000 = 3202623^2 + 977500^2 .
It is a cyclic number.
It is not a de Polignac number, because 11212300330129 - 215 = 11212300297361 is a prime.
It is a super-4 number, since 4×112123003301294 (a number of 53 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11212300330097 and 11212300330106.
It is not a weakly prime, because it can be changed into another prime (11212300330139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606150165064 + 5606150165065.
It is an arithmetic number, because the mean of its divisors is an integer number (5606150165065).
Almost surely, 211212300330129 is an apocalyptic number.
It is an amenable number.
11212300330129 is a deficient number, since it is larger than the sum of its proper divisors (1).
11212300330129 is an equidigital number, since it uses as much as digits as its factorization.
11212300330129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 11212300330129 in words is "eleven trillion, two hundred twelve billion, three hundred million, three hundred thirty thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •