Base | Representation |
---|---|
bin | 1101101101110… |
… | …01111110110101 |
3 | 22000111110221021 |
4 | 12312321332311 |
5 | 213423302230 |
6 | 15230021141 |
7 | 2564651611 |
oct | 666717665 |
9 | 260443837 |
10 | 115056565 |
11 | 59a45778 |
12 | 326477b1 |
13 | 1aab5b10 |
14 | 113d0341 |
15 | a17ac7a |
hex | 6db9fb5 |
115056565 has 32 divisors (see below), whose sum is σ = 152845056. Its totient is φ = 82629120.
The previous prime is 115056523. The next prime is 115056577. The reversal of 115056565 is 565650511.
It is a de Polignac number, because none of the positive numbers 2k-115056565 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115056565.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 493689 + ... + 493921.
It is an arithmetic number, because the mean of its divisors is an integer number (4776408).
Almost surely, 2115056565 is an apocalyptic number.
It is an amenable number.
115056565 is a deficient number, since it is larger than the sum of its proper divisors (37788491).
115056565 is a wasteful number, since it uses less digits than its factorization.
115056565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429.
The product of its (nonzero) digits is 22500, while the sum is 34.
The square root of 115056565 is about 10726.4423272584. The cubic root of 115056565 is about 486.3741311811.
The spelling of 115056565 in words is "one hundred fifteen million, fifty-six thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •