Base | Representation |
---|---|
bin | 1101101110010… |
… | …01011110000101 |
3 | 22000121200221220 |
4 | 12313021132011 |
5 | 213432320010 |
6 | 15231230553 |
7 | 2565334560 |
oct | 667113605 |
9 | 260550856 |
10 | 115120005 |
11 | 59a89400 |
12 | 32678459 |
13 | 1ab08960 |
14 | 114094d7 |
15 | a18e970 |
hex | 6dc9785 |
115120005 has 192 divisors, whose sum is σ = 270273024. Its totient is φ = 40550400.
The previous prime is 115119997. The next prime is 115120009. The reversal of 115120005 is 500021511.
115120005 = 3122 + 3132 + ... + 7212.
It is not a de Polignac number, because 115120005 - 23 = 115119997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115120009) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 2807785 + ... + 2807825.
It is an arithmetic number, because the mean of its divisors is an integer number (1407672).
Almost surely, 2115120005 is an apocalyptic number.
115120005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
115120005 is an abundant number, since it is smaller than the sum of its proper divisors (155153019).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115120005 is a wasteful number, since it uses less digits than its factorization.
115120005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108 (or 97 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 15.
The square root of 115120005 is about 10729.3990978060. The cubic root of 115120005 is about 486.4635072358.
Adding to 115120005 its reverse (500021511), we get a palindrome (615141516).
The spelling of 115120005 in words is "one hundred fifteen million, one hundred twenty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •