Base | Representation |
---|---|
bin | 1001000111010100010000… |
… | …0010001101100010101101 |
3 | 1022111000201122012001220122 |
4 | 2101311010002031202231 |
5 | 2303142110313211023 |
6 | 33151415520454325 |
7 | 2053005105441452 |
oct | 221650402154255 |
9 | 38430648161818 |
10 | 10021300132013 |
11 | 3214011740505 |
12 | 115a24117a3a5 |
13 | 579009cb6231 |
14 | 269067d6b829 |
15 | 125a24dc82c8 |
hex | 91d4408d8ad |
10021300132013 has 2 divisors, whose sum is σ = 10021300132014. Its totient is φ = 10021300132012.
The previous prime is 10021300132001. The next prime is 10021300132027. The reversal of 10021300132013 is 31023100312001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6035954685124 + 3985345446889 = 2456818^2 + 1996333^2 .
It is a cyclic number.
It is not a de Polignac number, because 10021300132013 - 218 = 10021299869869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10021300131982 and 10021300132000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10021300132813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010650066006 + 5010650066007.
It is an arithmetic number, because the mean of its divisors is an integer number (5010650066007).
Almost surely, 210021300132013 is an apocalyptic number.
It is an amenable number.
10021300132013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021300132013 is an equidigital number, since it uses as much as digits as its factorization.
10021300132013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10021300132013 its reverse (31023100312001), we get a palindrome (41044400444014).
The spelling of 10021300132013 in words is "ten trillion, twenty-one billion, three hundred million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •