Base | Representation |
---|---|
bin | 110101010100000010… |
… | …1110110111111011111 |
3 | 101221111221201220120002 |
4 | 1222220011312333133 |
5 | 3333433222223301 |
6 | 124332354044515 |
7 | 11162102431025 |
oct | 1525005667737 |
9 | 357457656502 |
10 | 114489257951 |
11 | 44611224052 |
12 | 1a23227973b |
13 | aa475b2163 |
14 | 57814d4715 |
15 | 2ea12b316b |
hex | 1aa8176fdf |
114489257951 has 2 divisors, whose sum is σ = 114489257952. Its totient is φ = 114489257950.
The previous prime is 114489257921. The next prime is 114489257959. The reversal of 114489257951 is 159752984411.
It is a strong prime.
It is an emirp because it is prime and its reverse (159752984411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114489257951 - 26 = 114489257887 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114489257959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57244628975 + 57244628976.
It is an arithmetic number, because the mean of its divisors is an integer number (57244628976).
Almost surely, 2114489257951 is an apocalyptic number.
114489257951 is a deficient number, since it is larger than the sum of its proper divisors (1).
114489257951 is an equidigital number, since it uses as much as digits as its factorization.
114489257951 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3628800, while the sum is 56.
The spelling of 114489257951 in words is "one hundred fourteen billion, four hundred eighty-nine million, two hundred fifty-seven thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •