Base | Representation |
---|---|
bin | 1101101101001… |
… | …10111010000000 |
3 | 22000100111202110 |
4 | 12312212322000 |
5 | 213413302212 |
6 | 15224215320 |
7 | 2564205042 |
oct | 666467200 |
9 | 260314673 |
10 | 114978432 |
11 | 599a1aa8 |
12 | 3260a540 |
13 | 1aa8939a |
14 | 113ada92 |
15 | a162a3c |
hex | 6da6e80 |
114978432 has 128 divisors (see below), whose sum is σ = 320443200. Its totient is φ = 36495360.
The previous prime is 114978427. The next prime is 114978439. The reversal of 114978432 is 234879411.
It is a tau number, because it is divible by the number of its divisors (128).
It is not an unprimeable number, because it can be changed into a prime (114978439) 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, 1054794 + ... + 1054902.
Almost surely, 2114978432 is an apocalyptic number.
114978432 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 114978432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160221600).
114978432 is an abundant number, since it is smaller than the sum of its proper divisors (205464768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114978432 is a wasteful number, since it uses less digits than its factorization.
114978432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234 (or 222 counting only the distinct ones).
The product of its digits is 48384, while the sum is 39.
The square root of 114978432 is about 10722.7996344238. The cubic root of 114978432 is about 486.2640100553.
The spelling of 114978432 in words is "one hundred fourteen million, nine hundred seventy-eight thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •