Base | Representation |
---|---|
bin | 1101101101101… |
… | …11100101101001 |
3 | 22000110222111011 |
4 | 12312313211221 |
5 | 213422444021 |
6 | 15225503521 |
7 | 2564611204 |
oct | 666674551 |
9 | 260428434 |
10 | 115046761 |
11 | 59a39375 |
12 | 32641ba1 |
13 | 1aab150b |
14 | 113ca93b |
15 | a177de1 |
hex | 6db7969 |
115046761 has 2 divisors, whose sum is σ = 115046762. Its totient is φ = 115046760.
The previous prime is 115046747. The next prime is 115046773. The reversal of 115046761 is 167640511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108056025 + 6990736 = 10395^2 + 2644^2 .
It is a cyclic number.
It is not a de Polignac number, because 115046761 - 213 = 115038569 is a prime.
It is a super-2 number, since 2×1150467612 = 26471514433182242, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (115046731) 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, 57523380 + 57523381.
It is an arithmetic number, because the mean of its divisors is an integer number (57523381).
Almost surely, 2115046761 is an apocalyptic number.
It is an amenable number.
115046761 is a deficient number, since it is larger than the sum of its proper divisors (1).
115046761 is an equidigital number, since it uses as much as digits as its factorization.
115046761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 31.
The square root of 115046761 is about 10725.9853160444. The cubic root of 115046761 is about 486.3603160997.
The spelling of 115046761 in words is "one hundred fifteen million, forty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •