Base | Representation |
---|---|
bin | 1001101001111010001100… |
… | …01001011001100011011011 |
3 | 2210011200102211212200000110 |
4 | 10310331012021121203123 |
5 | 10240322444223310321 |
6 | 113053251223335403 |
7 | 4320621635120442 |
oct | 464750611314333 |
9 | 83150384780013 |
10 | 21231200213211 |
11 | 684611302a0aa |
12 | 246a8b9bb1563 |
13 | bb012a801061 |
14 | 53584a377d59 |
15 | 26c413c29176 |
hex | 134f462598db |
21231200213211 has 16 divisors (see below), whose sum is σ = 29800748355200. Its totient is φ = 13408021404288.
The previous prime is 21231200213147. The next prime is 21231200213221. The reversal of 21231200213211 is 11231200213212.
It is not a de Polignac number, because 21231200213211 - 26 = 21231200213147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21231200213221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15412606 + ... + 16733523.
It is an arithmetic number, because the mean of its divisors is an integer number (1862546772200).
Almost surely, 221231200213211 is an apocalyptic number.
21231200213211 is a deficient number, since it is larger than the sum of its proper divisors (8569548141989).
21231200213211 is a wasteful number, since it uses less digits than its factorization.
21231200213211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32157738.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 21231200213211 its reverse (11231200213212), we get a palindrome (32462400426423).
Subtracting from 21231200213211 its reverse (11231200213212), we obtain a palindrome (9999999999999).
The spelling of 21231200213211 in words is "twenty-one trillion, two hundred thirty-one billion, two hundred million, two hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •