Base | Representation |
---|---|
bin | 110101101010110000… |
… | …1010110110111001101 |
3 | 102000111001220211021122 |
4 | 1223111201112313031 |
5 | 3342013332103401 |
6 | 124540142210325 |
7 | 11220016041236 |
oct | 1532541266715 |
9 | 360431824248 |
10 | 115251441101 |
11 | 44972485585 |
12 | 1a4055839a5 |
13 | ab394840c4 |
14 | 581481808d |
15 | 2ee816a21b |
hex | 1ad5856dcd |
115251441101 has 2 divisors, whose sum is σ = 115251441102. Its totient is φ = 115251441100.
The previous prime is 115251441091. The next prime is 115251441103. The reversal of 115251441101 is 101144152511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100634872900 + 14616568201 = 317230^2 + 120899^2 .
It is a cyclic number.
It is not a de Polignac number, because 115251441101 - 230 = 114177699277 is a prime.
Together with 115251441103, 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 (115251441103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57625720550 + 57625720551.
It is an arithmetic number, because the mean of its divisors is an integer number (57625720551).
Almost surely, 2115251441101 is an apocalyptic number.
It is an amenable number.
115251441101 is a deficient number, since it is larger than the sum of its proper divisors (1).
115251441101 is an equidigital number, since it uses as much as digits as its factorization.
115251441101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 800, while the sum is 26.
Adding to 115251441101 its reverse (101144152511), we get a palindrome (216395593612).
The spelling of 115251441101 in words is "one hundred fifteen billion, two hundred fifty-one million, four hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •