Base | Representation |
---|---|
bin | 101100111001… |
… | …100010011000 |
3 | 211010222102020 |
4 | 230321202120 |
5 | 11003120013 |
6 | 1100134440 |
7 | 202020615 |
oct | 54714230 |
9 | 24128366 |
10 | 11770008 |
11 | 6709a88 |
12 | 3b37420 |
13 | 2591403 |
14 | 17c550c |
15 | 1077623 |
hex | b39898 |
11770008 has 16 divisors (see below), whose sum is σ = 29425080. Its totient is φ = 3923328.
The previous prime is 11769991. The next prime is 11770013. The reversal of 11770008 is 80007711.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 490417 = 11770008 / (1 + 1 + 7 + 7 + 0 + 0 + 0 + 8).
It is a self number, because there is not a number n which added to its sum of digits gives 11770008.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 245185 + ... + 245232.
Almost surely, 211770008 is an apocalyptic number.
It is an amenable number.
11770008 is an abundant number, since it is smaller than the sum of its proper divisors (17655072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11770008 is a wasteful number, since it uses less digits than its factorization.
11770008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490426 (or 490422 counting only the distinct ones).
The product of its (nonzero) digits is 392, while the sum is 24.
The square root of 11770008 is about 3430.7445256096. The cubic root of 11770008 is about 227.4707638637.
Adding to 11770008 its reverse (80007711), we get a palindrome (91777719).
It can be divided in two parts, 117 and 70008, that added together give a triangular number (70125 = T374).
The spelling of 11770008 in words is "eleven million, seven hundred seventy thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •