Base | Representation |
---|---|
bin | 10101001111101001… |
… | …00101000110100101 |
3 | 1002102212111002200001 |
4 | 22213310211012211 |
5 | 141324302410000 |
6 | 5123431421301 |
7 | 552432155566 |
oct | 124764450645 |
9 | 32385432601 |
10 | 11405513125 |
11 | 4923129906 |
12 | 2263824831 |
13 | 10c9c49446 |
14 | 7a2aac16d |
15 | 46b49146a |
hex | 2a7d251a5 |
11405513125 has 40 divisors (see below), whose sum is σ = 15116961024. Its totient is φ = 8583960000.
The previous prime is 11405513123. The next prime is 11405513191. The reversal of 11405513125 is 52131550411.
11405513125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11405513125 - 21 = 11405513123 is a prime.
It is a hoax number, since the sum of its digits (28) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11405513093 and 11405513102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11405513123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 870372 + ... + 883378.
Almost surely, 211405513125 is an apocalyptic number.
It is an amenable number.
11405513125 is a deficient number, since it is larger than the sum of its proper divisors (3711447899).
11405513125 is an equidigital number, since it uses as much as digits as its factorization.
11405513125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13111 (or 13096 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 28.
The spelling of 11405513125 in words is "eleven billion, four hundred five million, five hundred thirteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •