Base | Representation |
---|---|
bin | 1001101001000001111101… |
… | …01011010011001000100101 |
3 | 2210001210111211212120110012 |
4 | 10310200332223103020211 |
5 | 10234324132042023023 |
6 | 113031335400540005 |
7 | 4315502536356665 |
oct | 464407653231045 |
9 | 83053454776405 |
10 | 21201010111013 |
11 | 6834330553517 |
12 | 2464a93481605 |
13 | baa328c38b65 |
14 | 5341c49a61a5 |
15 | 26b74859d978 |
hex | 13483ead3225 |
21201010111013 has 2 divisors, whose sum is σ = 21201010111014. Its totient is φ = 21201010111012.
The previous prime is 21201010110979. The next prime is 21201010111049. The reversal of 21201010111013 is 31011101010212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19663566347044 + 1537443763969 = 4434362^2 + 1239937^2 .
It is a cyclic number.
It is not a de Polignac number, because 21201010111013 - 226 = 21200943002149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21201010111213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600505055506 + 10600505055507.
It is an arithmetic number, because the mean of its divisors is an integer number (10600505055507).
Almost surely, 221201010111013 is an apocalyptic number.
It is an amenable number.
21201010111013 is a deficient number, since it is larger than the sum of its proper divisors (1).
21201010111013 is an equidigital number, since it uses as much as digits as its factorization.
21201010111013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 21201010111013 its reverse (31011101010212), we get a palindrome (52212111121225).
The spelling of 21201010111013 in words is "twenty-one trillion, two hundred one billion, ten million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •