Base | Representation |
---|---|
bin | 110101100110010111… |
… | …0111011110100100111 |
3 | 102000002210111022112200 |
4 | 1223030232323310213 |
5 | 3341213111133130 |
6 | 124513354145543 |
7 | 11213245621500 |
oct | 1531456736447 |
9 | 360083438480 |
10 | 115104005415 |
11 | 448a7234a03 |
12 | 1a3841222b3 |
13 | ab14a72459 |
14 | 57dcdd9ba7 |
15 | 2eda245760 |
hex | 1accbbbd27 |
115104005415 has 72 divisors (see below), whose sum is σ = 240090402240. Its totient is φ = 50804498304.
The previous prime is 115104005389. The next prime is 115104005437. The reversal of 115104005415 is 514500401511.
115104005415 is a `hidden beast` number, since 1 + 15 + 104 + 0 + 0 + 541 + 5 = 666.
It is not a de Polignac number, because 115104005415 - 29 = 115104004903 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 836079 + ... + 963968.
It is an arithmetic number, because the mean of its divisors is an integer number (3334588920).
Almost surely, 2115104005415 is an apocalyptic number.
115104005415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
115104005415 is an abundant number, since it is smaller than the sum of its proper divisors (124986396825).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115104005415 is a wasteful number, since it uses less digits than its factorization.
115104005415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1800101 (or 1800091 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
Adding to 115104005415 its reverse (514500401511), we get a palindrome (629604406926).
The spelling of 115104005415 in words is "one hundred fifteen billion, one hundred four million, five thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •