Base | Representation |
---|---|
bin | 11001111011101011100101… |
… | …011000111111010100001111 |
3 | 112221211022012120002222202121 |
4 | 121323223211120333110033 |
5 | 104422113313442024442 |
6 | 1042322542012233411 |
7 | 33011005021234066 |
oct | 3173534530772417 |
9 | 487738176088677 |
10 | 114052410111247 |
11 | 333823a0193093 |
12 | 1096015546b867 |
13 | 4b8413325592a |
14 | 2024247b031dd |
15 | d2bb71934967 |
hex | 67bae563f50f |
114052410111247 has 2 divisors, whose sum is σ = 114052410111248. Its totient is φ = 114052410111246.
The previous prime is 114052410111161. The next prime is 114052410111253. The reversal of 114052410111247 is 742111014250411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114052410111247 - 227 = 114052275893519 is a prime.
It is a super-4 number, since 4×1140524101112474 (a number of 57 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114052410111847) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57026205055623 + 57026205055624.
It is an arithmetic number, because the mean of its divisors is an integer number (57026205055624).
Almost surely, 2114052410111247 is an apocalyptic number.
114052410111247 is a deficient number, since it is larger than the sum of its proper divisors (1).
114052410111247 is an equidigital number, since it uses as much as digits as its factorization.
114052410111247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8960, while the sum is 34.
Adding to 114052410111247 its reverse (742111014250411), we get a palindrome (856163424361658).
The spelling of 114052410111247 in words is "one hundred fourteen trillion, fifty-two billion, four hundred ten million, one hundred eleven thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •