Base | Representation |
---|---|
bin | 110101101001010010… |
… | …1010001010100111101 |
3 | 102000100122010211111222 |
4 | 1223102211101110331 |
5 | 3341413221312412 |
6 | 124531221323125 |
7 | 11215546664561 |
oct | 1532245212475 |
9 | 360318124458 |
10 | 115202135357 |
11 | 44947669431 |
12 | 1a3b0b664a5 |
13 | ab2c1ac9ca |
14 | 580c0616a1 |
15 | 2ee3b7b072 |
hex | 1ad295153d |
115202135357 has 2 divisors, whose sum is σ = 115202135358. Its totient is φ = 115202135356.
The previous prime is 115202135333. The next prime is 115202135369. The reversal of 115202135357 is 753531202511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110422625401 + 4779509956 = 332299^2 + 69134^2 .
It is an emirp because it is prime and its reverse (753531202511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115202135357 - 232 = 110907168061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115202135387) 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, 57601067678 + 57601067679.
It is an arithmetic number, because the mean of its divisors is an integer number (57601067679).
Almost surely, 2115202135357 is an apocalyptic number.
It is an amenable number.
115202135357 is a deficient number, since it is larger than the sum of its proper divisors (1).
115202135357 is an equidigital number, since it uses as much as digits as its factorization.
115202135357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31500, while the sum is 35.
Adding to 115202135357 its reverse (753531202511), we get a palindrome (868733337868).
The spelling of 115202135357 in words is "one hundred fifteen billion, two hundred two million, one hundred thirty-five thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •