Base | Representation |
---|---|
bin | 1100110100011000100… |
… | …0101001001100111100 |
3 | 210001102111210021022022 |
4 | 3031012020221030330 |
5 | 12102002310100012 |
6 | 245100114535312 |
7 | 21624154066313 |
oct | 3150610511474 |
9 | 701374707268 |
10 | 220220003132 |
11 | 854384a5898 |
12 | 3681b297538 |
13 | 179c7465a7c |
14 | a9316b527a |
15 | 5add69b472 |
hex | 334622933c |
220220003132 has 12 divisors (see below), whose sum is σ = 387749331816. Its totient is φ = 109434479760.
The previous prime is 220220003131. The next prime is 220220003141. The reversal of 220220003132 is 231300022022.
220220003132 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 220220003132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220220003131) by changing a digit.
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, 168879719 + ... + 168881022.
It is an arithmetic number, because the mean of its divisors is an integer number (32312444318).
Almost surely, 2220220003132 is an apocalyptic number.
It is an amenable number.
220220003132 is a deficient number, since it is larger than the sum of its proper divisors (167529328684).
220220003132 is a wasteful number, since it uses less digits than its factorization.
220220003132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337760908 (or 337760906 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 220220003132 its reverse (231300022022), we get a palindrome (451520025154).
The spelling of 220220003132 in words is "two hundred twenty billion, two hundred twenty million, three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •