Base | Representation |
---|---|
bin | 10011101111101011… |
… | …011001101000110101 |
3 | 2000201112102102220202 |
4 | 103233223121220311 |
5 | 321404424013023 |
6 | 13423431010245 |
7 | 1350244351403 |
oct | 235753315065 |
9 | 60645372822 |
10 | 21201001013 |
11 | 8a9a459945 |
12 | 4138209985 |
13 | 1ccb45c91a |
14 | 10519d6473 |
15 | 841403128 |
hex | 4efad9a35 |
21201001013 has 2 divisors, whose sum is σ = 21201001014. Its totient is φ = 21201001012.
The previous prime is 21201000991. The next prime is 21201001039. The reversal of 21201001013 is 31010010212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16947613489 + 4253387524 = 130183^2 + 65218^2 .
It is a cyclic number.
It is not a de Polignac number, because 21201001013 - 28 = 21201000757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21201000985 and 21201001003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21201001043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10600500506 + 10600500507.
It is an arithmetic number, because the mean of its divisors is an integer number (10600500507).
Almost surely, 221201001013 is an apocalyptic number.
It is an amenable number.
21201001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
21201001013 is an equidigital number, since it uses as much as digits as its factorization.
21201001013 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 11.
Adding to 21201001013 its reverse (31010010212), we get a palindrome (52211011225).
The spelling of 21201001013 in words is "twenty-one billion, two hundred one million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •