Base | Representation |
---|---|
bin | 10100101011001110… |
… | …01010001010100001 |
3 | 1001122120121200100020 |
4 | 22111213022022201 |
5 | 140213100130100 |
6 | 5033235344053 |
7 | 542032325454 |
oct | 122547121241 |
9 | 31576550306 |
10 | 11100005025 |
11 | 478673307a |
12 | 2199452029 |
13 | 107b870515 |
14 | 7742a349b |
15 | 44e7455a0 |
hex | 2959ca2a1 |
11100005025 has 24 divisors (see below), whose sum is σ = 18356575104. Its totient is φ = 5918529600.
The previous prime is 11100005023. The next prime is 11100005089. The reversal of 11100005025 is 52050000111.
It is not a de Polignac number, because 11100005025 - 21 = 11100005023 is a prime.
It is a super-2 number, since 2×111000050252 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 11100004995 and 11100005013.
It is not an unprimeable number, because it can be changed into a prime (11100005023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 328207 + ... + 360443.
It is an arithmetic number, because the mean of its divisors is an integer number (764857296).
Almost surely, 211100005025 is an apocalyptic number.
11100005025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11100005025 is a deficient number, since it is larger than the sum of its proper divisors (7256570079).
11100005025 is a wasteful number, since it uses less digits than its factorization.
11100005025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36841 (or 36836 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 15.
Adding to 11100005025 its reverse (52050000111), we get a palindrome (63150005136).
The spelling of 11100005025 in words is "eleven billion, one hundred million, five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •