Base | Representation |
---|---|
bin | 11010000010100011111010… |
… | …100010001011100000000111 |
3 | 120000111111120212212010010221 |
4 | 122002203322202023200013 |
5 | 110002340113034311201 |
6 | 1043324053345325211 |
7 | 33060113332453132 |
oct | 3202437242134007 |
9 | 500444525763127 |
10 | 114525211244551 |
11 | 33544962099458 |
12 | 10a17905636807 |
13 | 4bb98b1444633 |
14 | 203d09a919219 |
15 | d390e47ee4a1 |
hex | 6828fa88b807 |
114525211244551 has 2 divisors, whose sum is σ = 114525211244552. Its totient is φ = 114525211244550.
The previous prime is 114525211244537. The next prime is 114525211244597. The reversal of 114525211244551 is 155442112525411.
It is a weak prime.
It is an emirp because it is prime and its reverse (155442112525411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 114525211244551 - 29 = 114525211244039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114525211244498 and 114525211244507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114535211244551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57262605622275 + 57262605622276.
It is an arithmetic number, because the mean of its divisors is an integer number (57262605622276).
Almost surely, 2114525211244551 is an apocalyptic number.
114525211244551 is a deficient number, since it is larger than the sum of its proper divisors (1).
114525211244551 is an equidigital number, since it uses as much as digits as its factorization.
114525211244551 is an evil number, because the sum of its binary digits is even.
The product of its digits is 320000, while the sum is 43.
Adding to 114525211244551 its reverse (155442112525411), we get a palindrome (269967323769962).
The spelling of 114525211244551 in words is "one hundred fourteen trillion, five hundred twenty-five billion, two hundred eleven million, two hundred forty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •