Base | Representation |
---|---|
bin | 1101110100111… |
… | …11000110101101 |
3 | 22002021011022002 |
4 | 12322133012231 |
5 | 214143320203 |
6 | 15302102045 |
7 | 2605640666 |
oct | 672370655 |
9 | 262234262 |
10 | 115995053 |
11 | 5a526889 |
12 | 32a1a925 |
13 | 1b054035 |
14 | 1159636d |
15 | a2b3d88 |
hex | 6e9f1ad |
115995053 has 2 divisors, whose sum is σ = 115995054. Its totient is φ = 115995052.
The previous prime is 115995017. The next prime is 115995079. The reversal of 115995053 is 350599511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90573289 + 25421764 = 9517^2 + 5042^2 .
It is a cyclic number.
It is not a de Polignac number, because 115995053 - 28 = 115994797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115994998 and 115995016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115995353) 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, 57997526 + 57997527.
It is an arithmetic number, because the mean of its divisors is an integer number (57997527).
Almost surely, 2115995053 is an apocalyptic number.
It is an amenable number.
115995053 is a deficient number, since it is larger than the sum of its proper divisors (1).
115995053 is an equidigital number, since it uses as much as digits as its factorization.
115995053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30375, while the sum is 38.
The square root of 115995053 is about 10770.0999531109. The cubic root of 115995053 is about 487.6929631025.
The spelling of 115995053 in words is "one hundred fifteen million, nine hundred ninety-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •