Base | Representation |
---|---|
bin | 1101100110010… |
… | …10110111000000 |
3 | 21221122201101112 |
4 | 12303022313000 |
5 | 213200431440 |
6 | 15153022452 |
7 | 2553432233 |
oct | 663126700 |
9 | 257581345 |
10 | 114077120 |
11 | 59436913 |
12 | 32254a28 |
13 | 1a832071 |
14 | 1121741a |
15 | a035965 |
hex | 6ccadc0 |
114077120 has 56 divisors (see below), whose sum is σ = 275527008. Its totient is φ = 44979200.
The previous prime is 114077113. The next prime is 114077143. The reversal of 114077120 is 21770411.
It is a hoax number, since the sum of its digits (23) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 20210 + ... + 25230.
Almost surely, 2114077120 is an apocalyptic number.
114077120 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 114077120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137763504).
114077120 is an abundant number, since it is smaller than the sum of its proper divisors (161449888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114077120 is an equidigital number, since it uses as much as digits as its factorization.
114077120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5109 (or 5099 counting only the distinct ones).
The product of its (nonzero) digits is 392, while the sum is 23.
The square root of 114077120 is about 10680.6891163445. The cubic root of 114077120 is about 484.9900731309.
The spelling of 114077120 in words is "one hundred fourteen million, seventy-seven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •