Base | Representation |
---|---|
bin | 1101101000101… |
… | …11001010000000 |
3 | 21222020121002001 |
4 | 12310113022000 |
5 | 213240432012 |
6 | 15203433344 |
7 | 2556203320 |
oct | 664271200 |
9 | 258217061 |
10 | 114389632 |
11 | 5962a695 |
12 | 32385854 |
13 | 1a911396 |
14 | 11299280 |
15 | a098357 |
hex | 6d17280 |
114389632 has 64 divisors (see below), whose sum is σ = 266587200. Its totient is φ = 47867904.
The previous prime is 114389629. The next prime is 114389669. The reversal of 114389632 is 236983411.
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 = 114389591 and 114389600.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37044 + ... + 40012.
It is an arithmetic number, because the mean of its divisors is an integer number (4165425).
Almost surely, 2114389632 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114389632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133293600).
114389632 is an abundant number, since it is smaller than the sum of its proper divisors (152197568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114389632 is an equidigital number, since it uses as much as digits as its factorization.
114389632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3033 (or 3021 counting only the distinct ones).
The product of its digits is 31104, while the sum is 37.
The square root of 114389632 is about 10695.3088781952. The cubic root of 114389632 is about 485.4325428820.
The spelling of 114389632 in words is "one hundred fourteen million, three hundred eighty-nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •