Base | Representation |
---|---|
bin | 1101101011100… |
… | …00111101001100 |
3 | 21222221021122000 |
4 | 12311300331030 |
5 | 213334214302 |
6 | 15215352300 |
7 | 2562264555 |
oct | 665607514 |
9 | 258837560 |
10 | 114757452 |
11 | 59860a77 |
12 | 32522690 |
13 | 1aa0c924 |
14 | 1135332c |
15 | a11c31c |
hex | 6d70f4c |
114757452 has 48 divisors (see below), whose sum is σ = 298821600. Its totient is φ = 38085120.
The previous prime is 114757421. The next prime is 114757457. The reversal of 114757452 is 254757411.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (114757457) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23824 + ... + 28232.
It is an arithmetic number, because the mean of its divisors is an integer number (6225450).
Almost surely, 2114757452 is an apocalyptic number.
114757452 is a gapful number since it is divisible by the number (12) 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 114757452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149410800).
114757452 is an abundant number, since it is smaller than the sum of its proper divisors (184064148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114757452 is a wasteful number, since it uses less digits than its factorization.
114757452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4663 (or 4655 counting only the distinct ones).
The product of its digits is 39200, while the sum is 36.
The square root of 114757452 is about 10712.4904667402. The cubic root of 114757452 is about 485.9522891740.
The spelling of 114757452 in words is "one hundred fourteen million, seven hundred fifty-seven thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •