Base | Representation |
---|---|
bin | 1001010001001001110001… |
… | …10001101001110110111001 |
3 | 2200011100211010111111212211 |
4 | 10220210320301221312321 |
5 | 10132403403011010441 |
6 | 111202412232335121 |
7 | 4202306403506251 |
oct | 450447061516671 |
9 | 80140733444784 |
10 | 20380572360121 |
11 | 6548396860006 |
12 | 2351a845444a1 |
13 | b4ab589b637c |
14 | 5065d4168961 |
15 | 25522adc1a81 |
hex | 128938c69db9 |
20380572360121 has 2 divisors, whose sum is σ = 20380572360122. Its totient is φ = 20380572360120.
The previous prime is 20380572360079. The next prime is 20380572360143. The reversal of 20380572360121 is 12106327508302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15955590858025 + 4424981502096 = 3994445^2 + 2103564^2 .
It is a cyclic number.
It is not a de Polignac number, because 20380572360121 - 27 = 20380572359993 is a prime.
It is a super-2 number, since 2×203805723601212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20380572660121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10190286180060 + 10190286180061.
It is an arithmetic number, because the mean of its divisors is an integer number (10190286180061).
Almost surely, 220380572360121 is an apocalyptic number.
It is an amenable number.
20380572360121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20380572360121 is an equidigital number, since it uses as much as digits as its factorization.
20380572360121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120960, while the sum is 40.
Adding to 20380572360121 its reverse (12106327508302), we get a palindrome (32486899868423).
The spelling of 20380572360121 in words is "twenty trillion, three hundred eighty billion, five hundred seventy-two million, three hundred sixty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •