Base | Representation |
---|---|
bin | 110101110110101010… |
… | …0000101011101101101 |
3 | 102001111220000222010122 |
4 | 1223231110011131231 |
5 | 3343323024141044 |
6 | 125043522014325 |
7 | 11232634003046 |
oct | 1535524053555 |
9 | 361456028118 |
10 | 115650615149 |
11 | 45057836993 |
12 | 1a4b71a73a5 |
13 | aba1096774 |
14 | 58518458cd |
15 | 301d218dee |
hex | 1aed50576d |
115650615149 has 2 divisors, whose sum is σ = 115650615150. Its totient is φ = 115650615148.
The previous prime is 115650615133. The next prime is 115650615161. The reversal of 115650615149 is 941516056511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115434819049 + 215796100 = 339757^2 + 14690^2 .
It is a cyclic number.
It is not a de Polignac number, because 115650615149 - 24 = 115650615133 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115650617149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57825307574 + 57825307575.
It is an arithmetic number, because the mean of its divisors is an integer number (57825307575).
Almost surely, 2115650615149 is an apocalyptic number.
It is an amenable number.
115650615149 is a deficient number, since it is larger than the sum of its proper divisors (1).
115650615149 is an equidigital number, since it uses as much as digits as its factorization.
115650615149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 44.
The spelling of 115650615149 in words is "one hundred fifteen billion, six hundred fifty million, six hundred fifteen thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •