Base | Representation |
---|---|
bin | 110010010001011011100010… |
… | …001011000010111101011010 |
3 | 1001222211222001120212021111010 |
4 | 302101123202023002331122 |
5 | 212440001021434310020 |
6 | 2102123554322514350 |
7 | 64366646053543014 |
oct | 6221334213027532 |
9 | 1058758046767433 |
10 | 221100121010010 |
11 | 644a4042272a50 |
12 | 2096a8272059b6 |
13 | 964a862439728 |
14 | 3c854354491b4 |
15 | 1a864c532ade0 |
hex | c916e22c2f5a |
221100121010010 has 256 divisors, whose sum is σ = 601346272665600. Its totient is φ = 51566479872000.
The previous prime is 221100121009927. The next prime is 221100121010023. The reversal of 221100121010010 is 10010121001122.
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 217237186 + ... + 218252594.
It is an arithmetic number, because the mean of its divisors is an integer number (2349008877600).
Almost surely, 2221100121010010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 221100121010010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (300673136332800).
221100121010010 is an abundant number, since it is smaller than the sum of its proper divisors (380246151655590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221100121010010 is a wasteful number, since it uses less digits than its factorization.
221100121010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015717.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 221100121010010 its reverse (10010121001122), we get a palindrome (231110242011132).
The spelling of 221100121010010 in words is "two hundred twenty-one trillion, one hundred billion, one hundred twenty-one million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •