Base | Representation |
---|---|
bin | 1100110011100110110… |
… | …1000000100101111010 |
3 | 210000212222022202221012 |
4 | 3030321231000211322 |
5 | 12101040411313224 |
6 | 245023304313522 |
7 | 21616042214162 |
oct | 3147155004572 |
9 | 700788282835 |
10 | 220011432314 |
11 | 85340799513 |
12 | 367814728a2 |
13 | 1799319a59b |
14 | a911b015a2 |
15 | 5aca1ec80e |
hex | 3339b4097a |
220011432314 has 8 divisors (see below), whose sum is σ = 331397974080. Its totient is φ = 109545440956.
The previous prime is 220011432283. The next prime is 220011432317. The reversal of 220011432314 is 413234110022.
220011432314 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 Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 220011432314.
It is not an unprimeable number, because it can be changed into a prime (220011432317) 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 3 ways as a sum of consecutive naturals, for example, 230137004 + ... + 230137959.
It is an arithmetic number, because the mean of its divisors is an integer number (41424746760).
Almost surely, 2220011432314 is an apocalyptic number.
220011432314 is a deficient number, since it is larger than the sum of its proper divisors (111386541766).
220011432314 is a wasteful number, since it uses less digits than its factorization.
220011432314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460275204.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 220011432314 its reverse (413234110022), we get a palindrome (633245542336).
The spelling of 220011432314 in words is "two hundred twenty billion, eleven million, four hundred thirty-two thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •