Base | Representation |
---|---|
bin | 1001101001100111100100… |
… | …01001011101111000100011 |
3 | 2210010201121222121112011121 |
4 | 10310303302021131320203 |
5 | 10240142004424311321 |
6 | 113044515105553111 |
7 | 4320116100235216 |
oct | 464636211357043 |
9 | 83121558545147 |
10 | 21221201010211 |
11 | 6841951809974 |
12 | 2468989345797 |
13 | bac1c60325a7 |
14 | 53517c38177d |
15 | 26c02ae77441 |
hex | 134cf225de23 |
21221201010211 has 8 divisors (see below), whose sum is σ = 21608958512048. Its totient is φ = 20834729604000.
The previous prime is 21221201010203. The next prime is 21221201010307. The reversal of 21221201010211 is 11201010212212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21221201010211 - 23 = 21221201010203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21221201010511) 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 7 ways as a sum of consecutive naturals, for example, 321490605 + ... + 321556606.
It is an arithmetic number, because the mean of its divisors is an integer number (2701119814006).
Almost surely, 221221201010211 is an apocalyptic number.
21221201010211 is a deficient number, since it is larger than the sum of its proper divisors (387757501837).
21221201010211 is an equidigital number, since it uses as much as digits as its factorization.
21221201010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 643047813.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21221201010211 its reverse (11201010212212), we get a palindrome (32422211222423).
The spelling of 21221201010211 in words is "twenty-one trillion, two hundred twenty-one billion, two hundred one million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •