Base | Representation |
---|---|
bin | 11001111110011101001100… |
… | …101010111010101010011001 |
3 | 112222111112110120002112020021 |
4 | 121332131030222322222121 |
5 | 104433224403041100144 |
6 | 1042550322045430441 |
7 | 33030536022531241 |
oct | 3176351452725231 |
9 | 488445416075207 |
10 | 114243121425049 |
11 | 33446265806921 |
12 | 109910ba26b421 |
13 | 4b99107058586 |
14 | 202d57a302b21 |
15 | d31ad46a5884 |
hex | 67e74cabaa99 |
114243121425049 has 2 divisors, whose sum is σ = 114243121425050. Its totient is φ = 114243121425048.
The previous prime is 114243121425047. The next prime is 114243121425077. The reversal of 114243121425049 is 940524121342411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114009155735049 + 233965690000 = 10677507^2 + 483700^2 .
It is a cyclic number.
It is not a de Polignac number, because 114243121425049 - 21 = 114243121425047 is a prime.
Together with 114243121425047, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 114243121424996 and 114243121425014.
It is not a weakly prime, because it can be changed into another prime (114243121425047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57121560712524 + 57121560712525.
It is an arithmetic number, because the mean of its divisors is an integer number (57121560712525).
Almost surely, 2114243121425049 is an apocalyptic number.
It is an amenable number.
114243121425049 is a deficient number, since it is larger than the sum of its proper divisors (1).
114243121425049 is an equidigital number, since it uses as much as digits as its factorization.
114243121425049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 276480, while the sum is 43.
The spelling of 114243121425049 in words is "one hundred fourteen trillion, two hundred forty-three billion, one hundred twenty-one million, four hundred twenty-five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •