Base | Representation |
---|---|
bin | 1101101001101… |
… | …00010000100111 |
3 | 21222110122121010 |
4 | 12310310100213 |
5 | 213303240324 |
6 | 15210153303 |
7 | 2560211004 |
oct | 664642047 |
9 | 258418533 |
10 | 114508839 |
11 | 59701205 |
12 | 32422833 |
13 | 1a953713 |
14 | 112ca8ab |
15 | a0bd829 |
hex | 6d34427 |
114508839 has 12 divisors (see below), whose sum is σ = 161138616. Its totient is φ = 72320688.
The previous prime is 114508837. The next prime is 114508861. The reversal of 114508839 is 938805411.
It is not a de Polignac number, because 114508839 - 21 = 114508837 is a prime.
It is a super-2 number, since 2×1145088392 = 26224548418255842, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114508797 and 114508806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114508837) 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 11 ways as a sum of consecutive naturals, for example, 51784 + ... + 53949.
It is an arithmetic number, because the mean of its divisors is an integer number (13428218).
Almost surely, 2114508839 is an apocalyptic number.
114508839 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
114508839 is a deficient number, since it is larger than the sum of its proper divisors (46629777).
114508839 is a wasteful number, since it uses less digits than its factorization.
114508839 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105774 (or 105755 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 39.
The square root of 114508839 is about 10700.8802908920. The cubic root of 114508839 is about 485.6011096377.
The spelling of 114508839 in words is "one hundred fourteen million, five hundred eight thousand, eight hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •