Base | Representation |
---|---|
bin | 1101101101101… |
… | …00001100110000 |
3 | 22000110021110001 |
4 | 12312310030300 |
5 | 213422023010 |
6 | 15225315344 |
7 | 2564522554 |
oct | 666641460 |
9 | 260407401 |
10 | 115032880 |
11 | 59a299a6 |
12 | 32635b54 |
13 | 1aaa80c1 |
14 | 113c5864 |
15 | a173c3a |
hex | 6db4330 |
115032880 has 80 divisors (see below), whose sum is σ = 290231424. Its totient is φ = 42229760.
The previous prime is 115032871. The next prime is 115032887. The reversal of 115032880 is 88230511.
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (115032887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54729 + ... + 56791.
Almost surely, 2115032880 is an apocalyptic number.
115032880 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 115032880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145115712).
115032880 is an abundant number, since it is smaller than the sum of its proper divisors (175198544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115032880 is a wasteful number, since it uses less digits than its factorization.
115032880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2134 (or 2128 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 28.
The square root of 115032880 is about 10725.3382231051. The cubic root of 115032880 is about 486.3407546650.
The spelling of 115032880 in words is "one hundred fifteen million, thirty-two thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •