Base | Representation |
---|---|
bin | 1100111000100001110… |
… | …0100011110001001100 |
3 | 210011022001011222120012 |
4 | 3032020130203301030 |
5 | 12111242111120022 |
6 | 245402340012352 |
7 | 21663553243622 |
oct | 3161034436114 |
9 | 704261158505 |
10 | 221332520012 |
11 | 8595948a22a |
12 | 36a8b9910b8 |
13 | 17b43aa9a96 |
14 | a9d9351512 |
15 | 5b561a5de2 |
hex | 3388723c4c |
221332520012 has 12 divisors (see below), whose sum is σ = 404172428016. Its totient is φ = 105854683440.
The previous prime is 221332519997. The next prime is 221332520033. The reversal of 221332520012 is 210025233122.
221332520012 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 221332520012.
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 3 ways as a sum of consecutive naturals, for example, 1202894039 + ... + 1202894222.
It is an arithmetic number, because the mean of its divisors is an integer number (33681035668).
Almost surely, 2221332520012 is an apocalyptic number.
It is an amenable number.
221332520012 is a deficient number, since it is larger than the sum of its proper divisors (182839908004).
221332520012 is a wasteful number, since it uses less digits than its factorization.
221332520012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2405788288 (or 2405788286 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 221332520012 its reverse (210025233122), we get a palindrome (431357753134).
The spelling of 221332520012 in words is "two hundred twenty-one billion, three hundred thirty-two million, five hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •