Base | Representation |
---|---|
bin | 110101101001011000… |
… | …0001100101110110101 |
3 | 102000100211112101020012 |
4 | 1223102300030232311 |
5 | 3341414440000432 |
6 | 124531402550005 |
7 | 11215613225624 |
oct | 1532260145665 |
9 | 360324471205 |
10 | 115205000117 |
11 | 449492457a9 |
12 | 1a3b1b08305 |
13 | ab2c97392c |
14 | 580c5a96bb |
15 | 2ee4044cb2 |
hex | 1ad2c0cbb5 |
115205000117 has 2 divisors, whose sum is σ = 115205000118. Its totient is φ = 115205000116.
The previous prime is 115205000111. The next prime is 115205000143. The reversal of 115205000117 is 711000502511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 62081203921 + 53123796196 = 249161^2 + 230486^2 .
It is a cyclic number.
It is not a de Polignac number, because 115205000117 - 224 = 115188222901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115205000092 and 115205000101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115205000111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57602500058 + 57602500059.
It is an arithmetic number, because the mean of its divisors is an integer number (57602500059).
Almost surely, 2115205000117 is an apocalyptic number.
It is an amenable number.
115205000117 is a deficient number, since it is larger than the sum of its proper divisors (1).
115205000117 is an equidigital number, since it uses as much as digits as its factorization.
115205000117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 350, while the sum is 23.
Adding to 115205000117 its reverse (711000502511), we get a palindrome (826205502628).
The spelling of 115205000117 in words is "one hundred fifteen billion, two hundred five million, one hundred seventeen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •