Base | Representation |
---|---|
bin | 1101101100001… |
… | …10110111101101 |
3 | 22000002211202111 |
4 | 12312012313231 |
5 | 213400102323 |
6 | 15221324021 |
7 | 2563120345 |
oct | 666066755 |
9 | 260084674 |
10 | 114847213 |
11 | 59912458 |
12 | 32566611 |
13 | 1aa41740 |
14 | 11377d25 |
15 | a138c0d |
hex | 6d86ded |
114847213 has 8 divisors (see below), whose sum is σ = 123780888. Its totient is φ = 105927744.
The previous prime is 114847207. The next prime is 114847253. The reversal of 114847213 is 312748411.
It can be written as a sum of positive squares in 4 ways, for example, as 40921609 + 73925604 = 6397^2 + 8598^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-114847213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114847253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18231 + ... + 23707.
It is an arithmetic number, because the mean of its divisors is an integer number (15472611).
Almost surely, 2114847213 is an apocalyptic number.
114847213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
114847213 is a deficient number, since it is larger than the sum of its proper divisors (8933675).
114847213 is a wasteful number, since it uses less digits than its factorization.
114847213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7103.
The product of its digits is 5376, while the sum is 31.
The square root of 114847213 is about 10716.6791964675. The cubic root of 114847213 is about 486.0789568975.
The spelling of 114847213 in words is "one hundred fourteen million, eight hundred forty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •