Base | Representation |
---|---|
bin | 10100101100101100… |
… | …11100011000101110 |
3 | 1001200102221102122022 |
4 | 22112112130120232 |
5 | 140224233303210 |
6 | 5034401150142 |
7 | 542242562615 |
oct | 122626343056 |
9 | 31612842568 |
10 | 11112400430 |
11 | 4792729a0a |
12 | 21a162b352 |
13 | 10812c0491 |
14 | 775bac87c |
15 | 450893155 |
hex | 29659c62e |
11112400430 has 64 divisors (see below), whose sum is σ = 21058652160. Its totient is φ = 4216368000.
The previous prime is 11112400393. The next prime is 11112400433. The reversal of 11112400430 is 3400421111.
It is a happy number.
11112400430 is digitally balanced in base 2, because in such base 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 = 11112400399 and 11112400408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112400433) 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 31 ways as a sum of consecutive naturals, for example, 8540780 + ... + 8542080.
It is an arithmetic number, because the mean of its divisors is an integer number (329041440).
Almost surely, 211112400430 is an apocalyptic number.
11112400430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11112400430 is a deficient number, since it is larger than the sum of its proper divisors (9946251730).
11112400430 is a wasteful number, since it uses less digits than its factorization.
11112400430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1865.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 11112400430 its reverse (3400421111), we get a palindrome (14512821541).
The spelling of 11112400430 in words is "eleven billion, one hundred twelve million, four hundred thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •