Base | Representation |
---|---|
bin | 110010010010111001011111… |
… | …101000110000110111000000 |
3 | 1002000012121110201200011002102 |
4 | 302102321133220300313000 |
5 | 212443124132102400000 |
6 | 2102242201412205532 |
7 | 64410150145525115 |
oct | 6222713750606700 |
9 | 1060177421604072 |
10 | 221201010200000 |
11 | 64532904617706 |
12 | 209862a29098a8 |
13 | 965722022939c |
14 | 3c8a28661090c |
15 | 1a88e2c6593d5 |
hex | c92e5fa30dc0 |
221201010200000 has 84 divisors (see below), whose sum is σ = 548647078105224. Its totient is φ = 88480404000000.
The previous prime is 221201010199993. The next prime is 221201010200011. The reversal of 221201010200000 is 2010102122.
It is a happy number.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 552802526 + ... + 553202525.
It is an arithmetic number, because the mean of its divisors is an integer number (6531512834586).
Almost surely, 2221201010200000 is an apocalyptic number.
221201010200000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
221201010200000 is an abundant number, since it is smaller than the sum of its proper divisors (327446067905224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221201010200000 is an frugal number, since it uses more digits than its factorization.
221201010200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1106005088 (or 1106005058 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 221201010200000 its reverse (2010102122), we get a palindrome (221203020302122).
The spelling of 221201010200000 in words is "two hundred twenty-one trillion, two hundred one billion, ten million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •