Base | Representation |
---|---|
bin | 1101101101111… |
… | …00001001000001 |
3 | 22000111221001211 |
4 | 12312330021001 |
5 | 213424043114 |
6 | 15230130121 |
7 | 2565016444 |
oct | 666741101 |
9 | 260457054 |
10 | 115065409 |
11 | 59a51388 |
12 | 32650941 |
13 | 1aab9b54 |
14 | 113d365b |
15 | a17d6c4 |
hex | 6dbc241 |
115065409 has 2 divisors, whose sum is σ = 115065410. Its totient is φ = 115065408.
The previous prime is 115065407. The next prime is 115065421. The reversal of 115065409 is 904560511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110313009 + 4752400 = 10503^2 + 2180^2 .
It is an emirp because it is prime and its reverse (904560511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115065409 - 21 = 115065407 is a prime.
Together with 115065407, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (115065407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57532704 + 57532705.
It is an arithmetic number, because the mean of its divisors is an integer number (57532705).
Almost surely, 2115065409 is an apocalyptic number.
It is an amenable number.
115065409 is a deficient number, since it is larger than the sum of its proper divisors (1).
115065409 is an equidigital number, since it uses as much as digits as its factorization.
115065409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 115065409 is about 10726.8545715881. The cubic root of 115065409 is about 486.3865928272.
The spelling of 115065409 in words is "one hundred fifteen million, sixty-five thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •