Base | Representation |
---|---|
bin | 110101101000001001… |
… | …0010101000001101101 |
3 | 102000020221122210222201 |
4 | 1223100102111001231 |
5 | 3341323341142331 |
6 | 124523323541501 |
7 | 11214601402405 |
oct | 1532022250155 |
9 | 360227583881 |
10 | 115163615341 |
11 | 44927949805 |
12 | 1a3a008a891 |
13 | ab242139b8 |
14 | 5806cb5805 |
15 | 2ee05bca61 |
hex | 1ad049506d |
115163615341 has 2 divisors, whose sum is σ = 115163615342. Its totient is φ = 115163615340.
The previous prime is 115163615311. The next prime is 115163615351. The reversal of 115163615341 is 143516361511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104953321225 + 10210294116 = 323965^2 + 101046^2 .
It is an emirp because it is prime and its reverse (143516361511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115163615341 - 27 = 115163615213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115163615341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115163615311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57581807670 + 57581807671.
It is an arithmetic number, because the mean of its divisors is an integer number (57581807671).
Almost surely, 2115163615341 is an apocalyptic number.
It is an amenable number.
115163615341 is a deficient number, since it is larger than the sum of its proper divisors (1).
115163615341 is an equidigital number, since it uses as much as digits as its factorization.
115163615341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 32400, while the sum is 37.
Adding to 115163615341 its reverse (143516361511), we get a palindrome (258679976852).
The spelling of 115163615341 in words is "one hundred fifteen billion, one hundred sixty-three million, six hundred fifteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •