Base | Representation |
---|---|
bin | 10100101101100111… |
… | …00011001011001111 |
3 | 1001200222022002000100 |
4 | 22112303203023033 |
5 | 140233211433130 |
6 | 5035232502143 |
7 | 542364461514 |
oct | 122663431317 |
9 | 31628262010 |
10 | 11120030415 |
11 | 4796a7048a |
12 | 21a40aa953 |
13 | 1082a62370 |
14 | 776bd730b |
15 | 45139dc60 |
hex | 296ce32cf |
11120030415 has 24 divisors (see below), whose sum is σ = 20757391200. Its totient is φ = 5474476224.
The previous prime is 11120030413. The next prime is 11120030417. The reversal of 11120030415 is 51403002111.
It is an interprime number because it is at equal distance from previous prime (11120030413) and next prime (11120030417).
It is not a de Polignac number, because 11120030415 - 21 = 11120030413 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120030413) 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 23 ways as a sum of consecutive naturals, for example, 9503715 + ... + 9504884.
It is an arithmetic number, because the mean of its divisors is an integer number (864891300).
Almost surely, 211120030415 is an apocalyptic number.
11120030415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11120030415 is a deficient number, since it is larger than the sum of its proper divisors (9637360785).
11120030415 is a wasteful number, since it uses less digits than its factorization.
11120030415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19008623 (or 19008620 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 11120030415 its reverse (51403002111), we get a palindrome (62523032526).
The spelling of 11120030415 in words is "eleven billion, one hundred twenty million, thirty thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •