Base | Representation |
---|---|
bin | 11010010000110011101101… |
… | …011101000110000011111111 |
3 | 120010222002122101101000002112 |
4 | 122100303231131012003333 |
5 | 110114410143023214411 |
6 | 1045353530050444235 |
7 | 33220622564532251 |
oct | 3220635535060377 |
9 | 503862571330075 |
10 | 115504244351231 |
11 | 3389209082403a |
12 | 10b555b589367b |
13 | 4c5b00791a408 |
14 | 20746144a9cd1 |
15 | d547e54a7b8b |
hex | 690ced7460ff |
115504244351231 has 2 divisors, whose sum is σ = 115504244351232. Its totient is φ = 115504244351230.
The previous prime is 115504244351203. The next prime is 115504244351233. The reversal of 115504244351231 is 132153442405511.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 115504244351231 - 210 = 115504244350207 is a prime.
It is a super-2 number, since 2×1155042443512312 (a number of 29 digits) contains 22 as substring.
Together with 115504244351233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115504244351233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57752122175615 + 57752122175616.
It is an arithmetic number, because the mean of its divisors is an integer number (57752122175616).
Almost surely, 2115504244351231 is an apocalyptic number.
115504244351231 is a deficient number, since it is larger than the sum of its proper divisors (1).
115504244351231 is an equidigital number, since it uses as much as digits as its factorization.
115504244351231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288000, while the sum is 41.
Adding to 115504244351231 its reverse (132153442405511), we get a palindrome (247657686756742).
The spelling of 115504244351231 in words is "one hundred fifteen trillion, five hundred four billion, two hundred forty-four million, three hundred fifty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •