Base | Representation |
---|---|
bin | 11010000010010110111010… |
… | …000010101010111110000111 |
3 | 120000110011112111122220112112 |
4 | 122002112322002222332013 |
5 | 110002123012022404002 |
6 | 1043313423414211235 |
7 | 33056110245651104 |
oct | 3202267202527607 |
9 | 500404474586475 |
10 | 114511244341127 |
11 | 33539a45146167 |
12 | 10a15068053b1b |
13 | 4bb849695303a |
14 | 203c5339b9aab |
15 | d38a78557852 |
hex | 6825ba0aaf87 |
114511244341127 has 2 divisors, whose sum is σ = 114511244341128. Its totient is φ = 114511244341126.
The previous prime is 114511244341079. The next prime is 114511244341171. The reversal of 114511244341127 is 721143442115411.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114511244341127 is a prime.
It is a super-2 number, since 2×1145112443411272 (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 (114511244341327) 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, 57255622170563 + 57255622170564.
It is an arithmetic number, because the mean of its divisors is an integer number (57255622170564).
Almost surely, 2114511244341127 is an apocalyptic number.
114511244341127 is a deficient number, since it is larger than the sum of its proper divisors (1).
114511244341127 is an equidigital number, since it uses as much as digits as its factorization.
114511244341127 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 107520, while the sum is 41.
Adding to 114511244341127 its reverse (721143442115411), we get a palindrome (835654686456538).
The spelling of 114511244341127 in words is "one hundred fourteen trillion, five hundred eleven billion, two hundred forty-four million, three hundred forty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •