Base | Representation |
---|---|
bin | 1100110011100111000… |
… | …0110100010001101011 |
3 | 210000220001012111002221 |
4 | 3030321300310101223 |
5 | 12101041140233233 |
6 | 245023341534511 |
7 | 21616053542161 |
oct | 3147160642153 |
9 | 700801174087 |
10 | 220012430443 |
11 | 85341310413 |
12 | 36781874437 |
13 | 179934599b0 |
14 | a911cc1231 |
15 | 5aca34842d |
hex | 3339c3446b |
220012430443 has 8 divisors (see below), whose sum is σ = 236942033328. Its totient is φ = 203083623264.
The previous prime is 220012430387. The next prime is 220012430453. The reversal of 220012430443 is 344034210022.
It is a happy number.
220012430443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220012430443 is a prime.
It is not an unprimeable number, because it can be changed into a prime (220012430453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 454980 + ... + 804382.
It is an arithmetic number, because the mean of its divisors is an integer number (29617754166).
Almost surely, 2220012430443 is an apocalyptic number.
220012430443 is a deficient number, since it is larger than the sum of its proper divisors (16929602885).
220012430443 is a wasteful number, since it uses less digits than its factorization.
220012430443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397853.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 220012430443 its reverse (344034210022), we get a palindrome (564046640465).
The spelling of 220012430443 in words is "two hundred twenty billion, twelve million, four hundred thirty thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •