Base | Representation |
---|---|
bin | 11001111111010010101011… |
… | …110111100011110000010111 |
3 | 112222201000201002000102012111 |
4 | 121333102223313203300113 |
5 | 104440200013101240323 |
6 | 1043032541010531451 |
7 | 33034641155245102 |
oct | 3177225367436027 |
9 | 488630632012174 |
10 | 114300553149463 |
11 | 3346865749747a |
12 | 109a0267b96b87 |
13 | 4ba165a69c665 |
14 | 2032267a51739 |
15 | d333466e2c0d |
hex | 67f4abde3c17 |
114300553149463 has 2 divisors, whose sum is σ = 114300553149464. Its totient is φ = 114300553149462.
The previous prime is 114300553149449. The next prime is 114300553149469. The reversal of 114300553149463 is 364941355003411.
It is a strong prime.
It is an emirp because it is prime and its reverse (364941355003411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114300553149463 - 229 = 114300016278551 is a prime.
It is a super-2 number, since 2×1143005531494632 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114300553149469) 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, 57150276574731 + 57150276574732.
It is an arithmetic number, because the mean of its divisors is an integer number (57150276574732).
Almost surely, 2114300553149463 is an apocalyptic number.
114300553149463 is a deficient number, since it is larger than the sum of its proper divisors (1).
114300553149463 is an equidigital number, since it uses as much as digits as its factorization.
114300553149463 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2332800, while the sum is 49.
The spelling of 114300553149463 in words is "one hundred fourteen trillion, three hundred billion, five hundred fifty-three million, one hundred forty-nine thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •