Base | Representation |
---|---|
bin | 10100101101111000… |
… | …10010001101100110 |
3 | 1001201010121102001022 |
4 | 22112330102031212 |
5 | 140234303221410 |
6 | 5035353531142 |
7 | 542423106410 |
oct | 122674221546 |
9 | 31633542038 |
10 | 11122320230 |
11 | 479829489a |
12 | 21a4a13ab2 |
13 | 1083384698 |
14 | 7772319b0 |
15 | 4516a2455 |
hex | 296f12366 |
11122320230 has 32 divisors (see below), whose sum is σ = 23412305664. Its totient is φ = 3724682976.
The previous prime is 11122320229. The next prime is 11122320271. The reversal of 11122320230 is 3202322111.
11122320230 is digitally balanced in base 2 and base 5, because in such bases it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11122320199 and 11122320208.
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 15 ways as a sum of consecutive naturals, for example, 1844552 + ... + 1850571.
It is an arithmetic number, because the mean of its divisors is an integer number (731634552).
Almost surely, 211122320230 is an apocalyptic number.
11122320230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11122320230 is an abundant number, since it is smaller than the sum of its proper divisors (12289985434).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122320230 is a wasteful number, since it uses less digits than its factorization.
11122320230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3695180.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11122320230 its reverse (3202322111), we get a palindrome (14324642341).
The spelling of 11122320230 in words is "eleven billion, one hundred twenty-two million, three hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •