Base | Representation |
---|---|
bin | 1101101010010… |
… | …01001010000000 |
3 | 21222122000000020 |
4 | 12311021022000 |
5 | 213314010212 |
6 | 15212053440 |
7 | 2561015361 |
oct | 665111200 |
9 | 258560006 |
10 | 114594432 |
11 | 5975a547 |
12 | 32464280 |
13 | 1a983674 |
14 | 1130db68 |
15 | a0d8d8c |
hex | 6d49280 |
114594432 has 64 divisors (see below), whose sum is σ = 307346400. Its totient is φ = 37827584.
The previous prime is 114594421. The next prime is 114594437. The reversal of 114594432 is 234495411.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 114594393 and 114594402.
It is not an unprimeable number, because it can be changed into a prime (114594437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39694 + ... + 42482.
Almost surely, 2114594432 is an apocalyptic number.
114594432 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 114594432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153673200).
114594432 is an abundant number, since it is smaller than the sum of its proper divisors (192751968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114594432 is a wasteful number, since it uses less digits than its factorization.
114594432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2913 (or 2901 counting only the distinct ones).
The product of its digits is 17280, while the sum is 33.
The square root of 114594432 is about 10704.8788876848. The cubic root of 114594432 is about 485.7220717816.
The spelling of 114594432 in words is "one hundred fourteen million, five hundred ninety-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •