Base | Representation |
---|---|
bin | 110101110111000101… |
… | …1001001111000011000 |
3 | 102001112220012101121201 |
4 | 1223232023021320120 |
5 | 3343340223114120 |
6 | 125045155243544 |
7 | 11233200466411 |
oct | 1535613117030 |
9 | 361486171551 |
10 | 115665051160 |
11 | 450649a697a |
12 | 1a4bbba95b4 |
13 | aba407c499 |
14 | 5853722808 |
15 | 301e61b40a |
hex | 1aee2c9e18 |
115665051160 has 96 divisors (see below), whose sum is σ = 270006516000. Its totient is φ = 44591662080.
The previous prime is 115665051143. The next prime is 115665051181. The reversal of 115665051160 is 61150566511.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21224116 + ... + 21229564.
It is an arithmetic number, because the mean of its divisors is an integer number (2812567875).
Almost surely, 2115665051160 is an apocalyptic number.
115665051160 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 115665051160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135003258000).
115665051160 is an abundant number, since it is smaller than the sum of its proper divisors (154341464840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115665051160 is a wasteful number, since it uses less digits than its factorization.
115665051160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6149 (or 6116 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 115665051160 in words is "one hundred fifteen billion, six hundred sixty-five million, fifty-one thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •