Base | Representation |
---|---|
bin | 1010000111010101101101… |
… | …0100001000000101111101 |
3 | 1110101011202201020002021202 |
4 | 2201311123110020011331 |
5 | 2424202210244111104 |
6 | 35353002042105245 |
7 | 2225323522046036 |
oct | 241653324100575 |
9 | 43334681202252 |
10 | 11121202332029 |
11 | 35a8525872969 |
12 | 12b74441ab225 |
13 | 62895673b19a |
14 | 2a63aa457a8d |
15 | 14444beab51e |
hex | a1d5b50817d |
11121202332029 has 2 divisors, whose sum is σ = 11121202332030. Its totient is φ = 11121202332028.
The previous prime is 11121202332017. The next prime is 11121202332043. The reversal of 11121202332029 is 92023320212111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10829924083225 + 291278248804 = 3290885^2 + 539702^2 .
It is a cyclic number.
It is not a de Polignac number, because 11121202332029 - 212 = 11121202327933 is a prime.
It is a super-2 number, since 2×111212023320292 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11121202331992 and 11121202332010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11121202332059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560601166014 + 5560601166015.
It is an arithmetic number, because the mean of its divisors is an integer number (5560601166015).
Almost surely, 211121202332029 is an apocalyptic number.
It is an amenable number.
11121202332029 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121202332029 is an equidigital number, since it uses as much as digits as its factorization.
11121202332029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 11121202332029 in words is "eleven trillion, one hundred twenty-one billion, two hundred two million, three hundred thirty-two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •