Base | Representation |
---|---|
bin | 1001000111101011010111… |
… | …11000000001011111110001 |
3 | 2122000020111021112110002002 |
4 | 10203311223320001133301 |
5 | 10112040131102401304 |
6 | 110353051223303345 |
7 | 4136632616430356 |
oct | 443655370013761 |
9 | 78006437473062 |
10 | 20055012153329 |
11 | 643231258906a |
12 | 22ba966baab55 |
13 | b2624457905a |
14 | 4d494c4d462d |
15 | 24ba2478331e |
hex | 123d6be017f1 |
20055012153329 has 2 divisors, whose sum is σ = 20055012153330. Its totient is φ = 20055012153328.
The previous prime is 20055012153311. The next prime is 20055012153347. The reversal of 20055012153329 is 92335121055002.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (20055012153311) and next prime (20055012153347).
It can be written as a sum of positive squares in only one way, i.e., 12724737480625 + 7330274672704 = 3567175^2 + 2707448^2 .
It is a cyclic number.
It is not a de Polignac number, because 20055012153329 - 228 = 20054743717873 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20055012153292 and 20055012153301.
It is not a weakly prime, because it can be changed into another prime (20055012153529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10027506076664 + 10027506076665.
It is an arithmetic number, because the mean of its divisors is an integer number (10027506076665).
Almost surely, 220055012153329 is an apocalyptic number.
It is an amenable number.
20055012153329 is a deficient number, since it is larger than the sum of its proper divisors (1).
20055012153329 is an equidigital number, since it uses as much as digits as its factorization.
20055012153329 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81000, while the sum is 38.
The spelling of 20055012153329 in words is "twenty trillion, fifty-five billion, twelve million, one hundred fifty-three thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •