Base | Representation |
---|---|
bin | 1101100111100… |
… | …10111011011111 |
3 | 21221222001112022 |
4 | 12303302323133 |
5 | 213221204442 |
6 | 15200330355 |
7 | 2555014601 |
oct | 663627337 |
9 | 257861468 |
10 | 114241247 |
11 | 5953915a |
12 | 323139bb |
13 | 1a88b993 |
14 | 1125b171 |
15 | a0693d2 |
hex | 6cf2edf |
114241247 has 4 divisors (see below), whose sum is σ = 114281856. Its totient is φ = 114200640.
The previous prime is 114241229. The next prime is 114241249. The reversal of 114241247 is 742142411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114241247 is a prime.
It is a super-2 number, since 2×1142412472 = 26102125032230018, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114241249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15743 + ... + 21824.
It is an arithmetic number, because the mean of its divisors is an integer number (28570464).
Almost surely, 2114241247 is an apocalyptic number.
114241247 is a deficient number, since it is larger than the sum of its proper divisors (40609).
114241247 is an equidigital number, since it uses as much as digits as its factorization.
114241247 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40608.
The product of its digits is 1792, while the sum is 26.
The square root of 114241247 is about 10688.3697073034. The cubic root of 114241247 is about 485.2225527661. Note that the first 3 decimals are identical.
Adding to 114241247 its reverse (742142411), we get a palindrome (856383658).
The spelling of 114241247 in words is "one hundred fourteen million, two hundred forty-one thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.943 sec. • engine limits •