Base | Representation |
---|---|
bin | 10101011011101000… |
… | …11011010000111000 |
3 | 1002200212211021110122 |
4 | 22231310123100320 |
5 | 142031032323440 |
6 | 5141424232412 |
7 | 555063354233 |
oct | 125564332070 |
9 | 32625737418 |
10 | 11506136120 |
11 | 4974a06406 |
12 | 229146b708 |
13 | 1114a4a68b |
14 | 7b21c241a |
15 | 47521a7b5 |
hex | 2add1b438 |
11506136120 has 32 divisors (see below), whose sum is σ = 26155710000. Its totient is φ = 4555004928.
The previous prime is 11506136113. The next prime is 11506136137. The reversal of 11506136120 is 2163160511.
11506136120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 11506136120.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 1478870 + ... + 1486629.
Almost surely, 211506136120 is an apocalyptic number.
11506136120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11506136120 is an abundant number, since it is smaller than the sum of its proper divisors (14649573880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11506136120 is a wasteful number, since it uses less digits than its factorization.
11506136120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2965607 (or 2965603 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 11506136120 its reverse (2163160511), we get a palindrome (13669296631).
The spelling of 11506136120 in words is "eleven billion, five hundred six million, one hundred thirty-six thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •