Base | Representation |
---|---|
bin | 1001000110001110011011… |
… | …00100000000110000100001 |
3 | 2121211110200121120221020212 |
4 | 10203013031210000300201 |
5 | 10110230432013421131 |
6 | 110314115450343505 |
7 | 4133215211541101 |
oct | 443071544006041 |
9 | 77743617527225 |
10 | 20005111467041 |
11 | 6413135988968 |
12 | 22b115b42ab95 |
13 | b2162126c64c |
14 | 4d2377057201 |
15 | 24a5a39a9a2b |
hex | 1231cd900c21 |
20005111467041 has 2 divisors, whose sum is σ = 20005111467042. Its totient is φ = 20005111467040.
The previous prime is 20005111467031. The next prime is 20005111467053. The reversal of 20005111467041 is 14076411150002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11114695844641 + 8890415622400 = 3333871^2 + 2981680^2 .
It is a cyclic number.
It is not a de Polignac number, because 20005111467041 - 238 = 19730233560097 is a prime.
It is a super-2 number, since 2×200051114670412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20005111466989 and 20005111467007.
It is not a weakly prime, because it can be changed into another prime (20005111467031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10002555733520 + 10002555733521.
It is an arithmetic number, because the mean of its divisors is an integer number (10002555733521).
Almost surely, 220005111467041 is an apocalyptic number.
It is an amenable number.
20005111467041 is a deficient number, since it is larger than the sum of its proper divisors (1).
20005111467041 is an equidigital number, since it uses as much as digits as its factorization.
20005111467041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6720, while the sum is 32.
The spelling of 20005111467041 in words is "twenty trillion, five billion, one hundred eleven million, four hundred sixty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •