Base | Representation |
---|---|
bin | 10100101000011111… |
… | …10000011011110000 |
3 | 1001120222111122002120 |
4 | 22110033300123300 |
5 | 140141213434404 |
6 | 5031100314240 |
7 | 541333511040 |
oct | 122417603360 |
9 | 31528448076 |
10 | 11077093104 |
11 | 4774804000 |
12 | 2191842980 |
13 | 1076baa87c |
14 | 77121b720 |
15 | 44c71b9d9 |
hex | 2943f06f0 |
11077093104 has 640 divisors, whose sum is σ = 40152858624. Its totient is φ = 2564812800.
The previous prime is 11077093067. The next prime is 11077093117. The reversal of 11077093104 is 40139077011.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 235682809 + ... + 235682855.
Almost surely, 211077093104 is an apocalyptic number.
11077093104 is a gapful number since it is divisible by the number (14) 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 11077093104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20076429312).
11077093104 is an abundant number, since it is smaller than the sum of its proper divisors (29075765520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11077093104 is a wasteful number, since it uses less digits than its factorization.
11077093104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146 (or 118 counting only the distinct ones).
The product of its (nonzero) digits is 5292, while the sum is 33.
The spelling of 11077093104 in words is "eleven billion, seventy-seven million, ninety-three thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •