Base | Representation |
---|---|
bin | 1101110000100… |
… | …01111111100100 |
3 | 22001011210102221 |
4 | 12320101333210 |
5 | 214021321220 |
6 | 15241442124 |
7 | 2601012613 |
oct | 670217744 |
9 | 261153387 |
10 | 115417060 |
11 | 5a171600 |
12 | 327a0344 |
13 | 1abb0c25 |
14 | 1148587a |
15 | a1ec9aa |
hex | 6e11fe4 |
115417060 has 72 divisors (see below), whose sum is σ = 273825720. Its totient is φ = 40803840.
The previous prime is 115417037. The next prime is 115417073. The reversal of 115417060 is 60714511.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 49871844 + 65545216 = 7062^2 + 8096^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 88896 + ... + 90184.
It is an arithmetic number, because the mean of its divisors is an integer number (3803135).
Almost surely, 2115417060 is an apocalyptic number.
115417060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 115417060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136912860).
115417060 is an abundant number, since it is smaller than the sum of its proper divisors (158408660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115417060 is a wasteful number, since it uses less digits than its factorization.
115417060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1357 (or 1344 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 25.
The square root of 115417060 is about 10743.2332191012. The cubic root of 115417060 is about 486.8815703996.
The spelling of 115417060 in words is "one hundred fifteen million, four hundred seventeen thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •