Base | Representation |
---|---|
bin | 10011110101101001… |
… | …010010100110101101 |
3 | 2000222111210120021221 |
4 | 103311221102212231 |
5 | 322111041024323 |
6 | 13441404423341 |
7 | 1352601313024 |
oct | 236551224655 |
9 | 60874716257 |
10 | 21301111213 |
11 | 9040a16148 |
12 | 4165847b51 |
13 | 2016111625 |
14 | 10610158bb |
15 | 84a0ca55d |
hex | 4f5a529ad |
21301111213 has 2 divisors, whose sum is σ = 21301111214. Its totient is φ = 21301111212.
The previous prime is 21301111199. The next prime is 21301111219. The reversal of 21301111213 is 31211110312.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14217700644 + 7083410569 = 119238^2 + 84163^2 .
It is a cyclic number.
It is not a de Polignac number, because 21301111213 - 225 = 21267556781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21301111219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10650555606 + 10650555607.
It is an arithmetic number, because the mean of its divisors is an integer number (10650555607).
Almost surely, 221301111213 is an apocalyptic number.
It is an amenable number.
21301111213 is a deficient number, since it is larger than the sum of its proper divisors (1).
21301111213 is an equidigital number, since it uses as much as digits as its factorization.
21301111213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 21301111213 its reverse (31211110312), we get a palindrome (52512221525).
Subtracting 21301111213 from its reverse (31211110312), we obtain a palindrome (9909999099).
The spelling of 21301111213 in words is "twenty-one billion, three hundred one million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •