Base | Representation |
---|---|
bin | 1001001001111010111101… |
… | …01111000110000000001101 |
3 | 2122021121110202000201002022 |
4 | 10210331132233012000031 |
5 | 10114321020341320023 |
6 | 110452320511335525 |
7 | 4145332143016361 |
oct | 444753657060015 |
9 | 78247422021068 |
10 | 20132101120013 |
11 | 6461a8126a793 |
12 | 231189bb215a5 |
13 | b305ab57913c |
14 | 4d85827c52a1 |
15 | 24da373d37c8 |
hex | 124f5ebc600d |
20132101120013 has 2 divisors, whose sum is σ = 20132101120014. Its totient is φ = 20132101120012.
The previous prime is 20132101120007. The next prime is 20132101120049. The reversal of 20132101120013 is 31002110123102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15251196257284 + 4880904862729 = 3905278^2 + 2209277^2 .
It is a cyclic number.
It is not a de Polignac number, because 20132101120013 - 234 = 20114921250829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20132101119973 and 20132101120000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20132101120003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10066050560006 + 10066050560007.
It is an arithmetic number, because the mean of its divisors is an integer number (10066050560007).
Almost surely, 220132101120013 is an apocalyptic number.
It is an amenable number.
20132101120013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20132101120013 is an equidigital number, since it uses as much as digits as its factorization.
20132101120013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 20132101120013 its reverse (31002110123102), we get a palindrome (51134211243115).
The spelling of 20132101120013 in words is "twenty trillion, one hundred thirty-two billion, one hundred one million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •