Base | Representation |
---|---|
bin | 10100110010110111… |
… | …10110101101101000 |
3 | 1001211001022121120110 |
4 | 22121123312231220 |
5 | 140331010310012 |
6 | 5043450254320 |
7 | 543441500055 |
oct | 123133665550 |
9 | 31731277513 |
10 | 11164150632 |
11 | 4809965678 |
12 | 21b6a273a0 |
13 | 108bc3c3bb |
14 | 77ca0002c |
15 | 4551b673c |
hex | 2996f6b68 |
11164150632 has 64 divisors (see below), whose sum is σ = 28021593600. Its totient is φ = 3706592960.
The previous prime is 11164150607. The next prime is 11164150633. The reversal of 11164150632 is 23605146111.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 11164150632.
It is not an unprimeable number, because it can be changed into a prime (11164150633) 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 15 ways as a sum of consecutive naturals, for example, 10232407 + ... + 10233497.
It is an arithmetic number, because the mean of its divisors is an integer number (437837400).
Almost surely, 211164150632 is an apocalyptic number.
11164150632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11164150632 is an abundant number, since it is smaller than the sum of its proper divisors (16857442968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11164150632 is a wasteful number, since it uses less digits than its factorization.
11164150632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2406 (or 2402 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 11164150632 its reverse (23605146111), we get a palindrome (34769296743).
The spelling of 11164150632 in words is "eleven billion, one hundred sixty-four million, one hundred fifty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •