Base | Representation |
---|---|
bin | 10101100111100110… |
… | …00111110110101000 |
3 | 1002221212121010220020 |
4 | 22303303013312220 |
5 | 142232223122033 |
6 | 5155410400440 |
7 | 560422156203 |
oct | 126363076650 |
9 | 32855533806 |
10 | 11606457768 |
11 | 4a165a7564 |
12 | 22bab90120 |
13 | 112c7746b9 |
14 | 7c165893a |
15 | 47de356b3 |
hex | 2b3cc7da8 |
11606457768 has 32 divisors (see below), whose sum is σ = 29297860800. Its totient is φ = 3831257088.
The previous prime is 11606457767. The next prime is 11606457769. The reversal of 11606457768 is 86775460611.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11606457767) and next prime (11606457769).
It is a self number, because there is not a number n which added to its sum of digits gives 11606457768.
It is not an unprimeable number, because it can be changed into a prime (11606457767) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2345113 + ... + 2350056.
It is an arithmetic number, because the mean of its divisors is an integer number (915558150).
Almost surely, 211606457768 is an apocalyptic number.
It is an amenable number.
11606457768 is an abundant number, since it is smaller than the sum of its proper divisors (17691403032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11606457768 is a wasteful number, since it uses less digits than its factorization.
11606457768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4695281 (or 4695277 counting only the distinct ones).
The product of its (nonzero) digits is 1693440, while the sum is 51.
The spelling of 11606457768 in words is "eleven billion, six hundred six million, four hundred fifty-seven thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •