Base | Representation |
---|---|
bin | 10100100010100110… |
… | …00000001000000000 |
3 | 1001110112101202000000 |
4 | 22101103000020000 |
5 | 140041032042120 |
6 | 5022132000000 |
7 | 540163104525 |
oct | 122123001000 |
9 | 31415352000 |
10 | 11027612160 |
11 | 4749888264 |
12 | 2179160000 |
13 | 10698747c6 |
14 | 76881b14c |
15 | 4481e5990 |
hex | 2914c0200 |
11027612160 has 560 divisors, whose sum is σ = 41863124160. Its totient is φ = 2776965120.
The previous prime is 11027612137. The next prime is 11027612161. The reversal of 11027612160 is 6121672011.
It is a happy number.
11027612160 is a `hidden beast` number, since 1 + 10 + 27 + 612 + 16 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (11027612161) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 35458405 + ... + 35458715.
Almost surely, 211027612160 is an apocalyptic number.
11027612160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11027612160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20931562080).
11027612160 is an abundant number, since it is smaller than the sum of its proper divisors (30835512000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11027612160 is an frugal number, since it uses more digits than its factorization.
11027612160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 371 (or 340 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The spelling of 11027612160 in words is "eleven billion, twenty-seven million, six hundred twelve thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •