Base | Representation |
---|---|
bin | 1100111000000100100… |
… | …1001111001001011100 |
3 | 210010222111200001022121 |
4 | 3032001021033021130 |
5 | 12111014230424200 |
6 | 245342242152324 |
7 | 21660535045252 |
oct | 3160111171134 |
9 | 703874601277 |
10 | 221210014300 |
11 | 858a6316940 |
12 | 36a569526a4 |
13 | 17b245b64b2 |
14 | a9c6d825d2 |
15 | 5b4a557e1a |
hex | 338124f25c |
221210014300 has 36 divisors (see below), whose sum is σ = 523664436456. Its totient is φ = 80440004800.
The previous prime is 221210014273. The next prime is 221210014349. The reversal of 221210014300 is 3410012122.
221210014300 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 100548907 + ... + 100551106.
It is an arithmetic number, because the mean of its divisors is an integer number (14546234346).
Almost surely, 2221210014300 is an apocalyptic number.
221210014300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
221210014300 is an abundant number, since it is smaller than the sum of its proper divisors (302454422156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221210014300 is a wasteful number, since it uses less digits than its factorization.
221210014300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201100038 (or 201100031 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 221210014300 its reverse (3410012122), we get a palindrome (224620026422).
The spelling of 221210014300 in words is "two hundred twenty-one billion, two hundred ten million, fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •