Base | Representation |
---|---|
bin | 1101101110001… |
… | …01110010010011 |
3 | 22000120221021000 |
4 | 12313011302103 |
5 | 213431324130 |
6 | 15231033043 |
7 | 2565242562 |
oct | 667056223 |
9 | 260527230 |
10 | 115104915 |
11 | 59a79032 |
12 | 3266b783 |
13 | 1ab01b23 |
14 | 11403bd9 |
15 | a18a260 |
hex | 6dc5c93 |
115104915 has 32 divisors (see below), whose sum is σ = 211694400. Its totient is φ = 59270400.
The previous prime is 115104893. The next prime is 115104961. The reversal of 115104915 is 519401511.
It is not a de Polignac number, because 115104915 - 25 = 115104883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10786 + ... + 18615.
It is an arithmetic number, because the mean of its divisors is an integer number (6615450).
Almost surely, 2115104915 is an apocalyptic number.
115104915 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
115104915 is a deficient number, since it is larger than the sum of its proper divisors (96589485).
115104915 is a wasteful number, since it uses less digits than its factorization.
115104915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29444 (or 29438 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The square root of 115104915 is about 10728.6958666932. The cubic root of 115104915 is about 486.4422509966.
The spelling of 115104915 in words is "one hundred fifteen million, one hundred four thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •