Base | Representation |
---|---|
bin | 11001010000110001001000… |
… | …011110101101110000100110 |
3 | 112120101101101001210211112021 |
4 | 121100301020132231300212 |
5 | 104030304311041233410 |
6 | 1032144113334413354 |
7 | 32254646366131000 |
oct | 3120611036556046 |
9 | 476341331724467 |
10 | 111103430024230 |
11 | 32445777874156 |
12 | 10564709b0125a |
13 | 49cc015885567 |
14 | 1d61612b8d370 |
15 | cca0c639beda |
hex | 650c487adc26 |
111103430024230 has 64 divisors (see below), whose sum is σ = 234705507062400. Its totient is φ = 37849976341632.
The previous prime is 111103430024207. The next prime is 111103430024303. The reversal of 111103430024230 is 32420034301111.
It is a junction number, because it is equal to n+sod(n) for n = 111103430024195 and 111103430024204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 102619677 + ... + 103696696.
It is an arithmetic number, because the mean of its divisors is an integer number (3667273547850).
Almost surely, 2111103430024230 is an apocalyptic number.
111103430024230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111103430024230 is an abundant number, since it is smaller than the sum of its proper divisors (123602077038170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111103430024230 is a wasteful number, since it uses less digits than its factorization.
111103430024230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206316558 (or 206316544 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 111103430024230 its reverse (32420034301111), we get a palindrome (143523464325341).
The spelling of 111103430024230 in words is "one hundred eleven trillion, one hundred three billion, four hundred thirty million, twenty-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •