Base | Representation |
---|---|
bin | 110101101000001101… |
… | …0011000110110001001 |
3 | 102000021002122011012102 |
4 | 1223100122120312021 |
5 | 3341324411300022 |
6 | 124523441123145 |
7 | 11214625352225 |
oct | 1532032306611 |
9 | 360232564172 |
10 | 115165728137 |
11 | 44929062119 |
12 | 1a3a09294b5 |
13 | ab247a3585 |
14 | 58072a5785 |
15 | 2ee0888a92 |
hex | 1ad0698d89 |
115165728137 has 2 divisors, whose sum is σ = 115165728138. Its totient is φ = 115165728136.
The previous prime is 115165728103. The next prime is 115165728173. The reversal of 115165728137 is 731827561511.
Together with next prime (115165728173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113630342281 + 1535385856 = 337091^2 + 39184^2 .
It is a cyclic number.
It is not a de Polignac number, because 115165728137 - 212 = 115165724041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115165728091 and 115165728100.
It is not a weakly prime, because it can be changed into another prime (115165728737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57582864068 + 57582864069.
It is an arithmetic number, because the mean of its divisors is an integer number (57582864069).
Almost surely, 2115165728137 is an apocalyptic number.
It is an amenable number.
115165728137 is a deficient number, since it is larger than the sum of its proper divisors (1).
115165728137 is an equidigital number, since it uses as much as digits as its factorization.
115165728137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 352800, while the sum is 47.
The spelling of 115165728137 in words is "one hundred fifteen billion, one hundred sixty-five million, seven hundred twenty-eight thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •