Base | Representation |
---|---|
bin | 1101101011100… |
… | …11101001110100 |
3 | 21222221211210012 |
4 | 12311303221310 |
5 | 213340043000 |
6 | 15215515352 |
7 | 2562342020 |
oct | 665635164 |
9 | 258854705 |
10 | 114768500 |
11 | 59869300 |
12 | 32528b58 |
13 | 1aa14972 |
14 | 11357380 |
15 | a120735 |
hex | 6d73a74 |
114768500 has 144 divisors (see below), whose sum is σ = 316033536. Its totient is φ = 35640000.
The previous prime is 114768491. The next prime is 114768509. The reversal of 114768500 is 5867411.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (114768491) and next prime (114768509).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114768509) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 423365 + ... + 423635.
Almost surely, 2114768500 is an apocalyptic number.
114768500 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 114768500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158016768).
114768500 is an abundant number, since it is smaller than the sum of its proper divisors (201265036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114768500 is a wasteful number, since it uses less digits than its factorization.
114768500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 319 (or 296 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 32.
The square root of 114768500 is about 10713.0061140653. The cubic root of 114768500 is about 485.9678833061.
The spelling of 114768500 in words is "one hundred fourteen million, seven hundred sixty-eight thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •