Base | Representation |
---|---|
bin | 10101001101100011… |
… | …10011111010001101 |
3 | 1002101122112212001210 |
4 | 22212301303322031 |
5 | 141310312311000 |
6 | 5122004325033 |
7 | 552130326462 |
oct | 124661637215 |
9 | 32348485053 |
10 | 11388010125 |
11 | 4914264618 |
12 | 22599a3779 |
13 | 10c642b73b |
14 | 7a0633669 |
15 | 469b85350 |
hex | 2a6c73e8d |
11388010125 has 64 divisors (see below), whose sum is σ = 19926466560. Its totient is φ = 5764616000.
The previous prime is 11388010121. The next prime is 11388010157. The reversal of 11388010125 is 52101088311.
It is not a de Polignac number, because 11388010125 - 22 = 11388010121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11388010092 and 11388010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11388010121) 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 63 ways as a sum of consecutive naturals, for example, 1124836 + ... + 1134914.
It is an arithmetic number, because the mean of its divisors is an integer number (311351040).
Almost surely, 211388010125 is an apocalyptic number.
11388010125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11388010125 is a deficient number, since it is larger than the sum of its proper divisors (8538456435).
11388010125 is a wasteful number, since it uses less digits than its factorization.
11388010125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10251 (or 10241 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 30.
Adding to 11388010125 its reverse (52101088311), we get a palindrome (63489098436).
The spelling of 11388010125 in words is "eleven billion, three hundred eighty-eight million, ten thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •