Base | Representation |
---|---|
bin | 1001001001010110001000… |
… | …11010010001100110001101 |
3 | 2122012201110000010112121001 |
4 | 10210223010122101212031 |
5 | 10114010024004231104 |
6 | 110435251112540301 |
7 | 4144032224105416 |
oct | 444530432214615 |
9 | 78181400115531 |
10 | 20112332102029 |
11 | 64546571649a2 |
12 | 2309aa33b1691 |
13 | b2b77a9b576b |
14 | 4d762906880d |
15 | 24d27ba91aa4 |
hex | 124ac469198d |
20112332102029 has 2 divisors, whose sum is σ = 20112332102030. Its totient is φ = 20112332102028.
The previous prime is 20112332101991. The next prime is 20112332102053. The reversal of 20112332102029 is 92020123321102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14797854852804 + 5314477249225 = 3846798^2 + 2305315^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112332102029 - 29 = 20112332101517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20112332101988 and 20112332102006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20112332103029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056166051014 + 10056166051015.
It is an arithmetic number, because the mean of its divisors is an integer number (10056166051015).
Almost surely, 220112332102029 is an apocalyptic number.
It is an amenable number.
20112332102029 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112332102029 is an equidigital number, since it uses as much as digits as its factorization.
20112332102029 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 28.
The spelling of 20112332102029 in words is "twenty trillion, one hundred twelve billion, three hundred thirty-two million, one hundred two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •