Base | Representation |
---|---|
bin | 1101101001111… |
… | …11100101100000 |
3 | 21222120000020101 |
4 | 12310333211200 |
5 | 213311231412 |
6 | 15211152144 |
7 | 2560463161 |
oct | 664774540 |
9 | 258500211 |
10 | 114555232 |
11 | 59733050 |
12 | 32445654 |
13 | 1a96b87c |
14 | 112dd768 |
15 | a0cc457 |
hex | 6d3f960 |
114555232 has 48 divisors (see below), whose sum is σ = 246903552. Its totient is φ = 51886720.
The previous prime is 114555227. The next prime is 114555239. The reversal of 114555232 is 232555411.
It is a self number, because there is not a number n which added to its sum of digits gives 114555232.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114555239) 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, 176733 + ... + 177379.
It is an arithmetic number, because the mean of its divisors is an integer number (5143824).
Almost surely, 2114555232 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 114555232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123451776).
114555232 is an abundant number, since it is smaller than the sum of its proper divisors (132348320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114555232 is a wasteful number, since it uses less digits than its factorization.
114555232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1171 (or 1163 counting only the distinct ones).
The product of its digits is 6000, while the sum is 28.
The square root of 114555232 is about 10703.0477902325. The cubic root of 114555232 is about 485.6666808510. Note that the first 4 decimals are identical.
The spelling of 114555232 in words is "one hundred fourteen million, five hundred fifty-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •