Base | Representation |
---|---|
bin | 10100101100110100… |
… | …10010111110000000 |
3 | 1001200111211202002210 |
4 | 22112122102332000 |
5 | 140230013113212 |
6 | 5034434542120 |
7 | 542254300335 |
oct | 122632227600 |
9 | 31614752083 |
10 | 11113410432 |
11 | 4793259823 |
12 | 21a1a37940 |
13 | 1081585107 |
14 | 775d9298c |
15 | 4509e253c |
hex | 296692f80 |
11113410432 has 64 divisors (see below), whose sum is σ = 29531986560. Its totient is φ = 3702965760.
The previous prime is 11113410419. The next prime is 11113410437. The reversal of 11113410432 is 23401431111.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 11113410399 and 11113410408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11113410437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1344103 + ... + 1352345.
It is an arithmetic number, because the mean of its divisors is an integer number (461437290).
Almost surely, 211113410432 is an apocalyptic number.
11113410432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11113410432 is an abundant number, since it is smaller than the sum of its proper divisors (18418576128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11113410432 is an equidigital number, since it uses as much as digits as its factorization.
11113410432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11771 (or 11759 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11113410432 its reverse (23401431111), we get a palindrome (34514841543).
The spelling of 11113410432 in words is "eleven billion, one hundred thirteen million, four hundred ten thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •