Base | Representation |
---|---|
bin | 110101100100110011… |
… | …1010001011011110001 |
3 | 101222222011000011011212 |
4 | 1223021213101123301 |
5 | 3341111211241022 |
6 | 124504244245505 |
7 | 11212042006103 |
oct | 1531147213361 |
9 | 358864004155 |
10 | 115051665137 |
11 | 4487a735982 |
12 | 1a36a6a0895 |
13 | ab06c77a86 |
14 | 57d6093573 |
15 | 2ed58573e2 |
hex | 1ac99d16f1 |
115051665137 has 2 divisors, whose sum is σ = 115051665138. Its totient is φ = 115051665136.
The previous prime is 115051665133. The next prime is 115051665161. The reversal of 115051665137 is 731566150511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84044329216 + 31007335921 = 289904^2 + 176089^2 .
It is a cyclic number.
It is not a de Polignac number, because 115051665137 - 22 = 115051665133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115051665094 and 115051665103.
It is not a weakly prime, because it can be changed into another prime (115051665133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57525832568 + 57525832569.
It is an arithmetic number, because the mean of its divisors is an integer number (57525832569).
Almost surely, 2115051665137 is an apocalyptic number.
It is an amenable number.
115051665137 is a deficient number, since it is larger than the sum of its proper divisors (1).
115051665137 is an equidigital number, since it uses as much as digits as its factorization.
115051665137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 94500, while the sum is 41.
The spelling of 115051665137 in words is "one hundred fifteen billion, fifty-one million, six hundred sixty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •