Base | Representation |
---|---|
bin | 10100100110111011… |
… | …10100111000100000 |
3 | 1001120001212122101200 |
4 | 22103131310320200 |
5 | 140124341113003 |
6 | 5025512001200 |
7 | 541114324542 |
oct | 122335647040 |
9 | 31501778350 |
10 | 11064004128 |
11 | 4768384071 |
12 | 2189390200 |
13 | 1074277008 |
14 | 76d5b1692 |
15 | 44b4d36a3 |
hex | 293774e20 |
11064004128 has 144 divisors (see below), whose sum is σ = 31826864160. Its totient is φ = 3645637632.
The previous prime is 11064004109. The next prime is 11064004151. The reversal of 11064004128 is 82140046011.
It is a happy number.
11064004128 is a `hidden beast` number, since 1 + 1 + 0 + 640 + 0 + 4 + 12 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (144).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12529575 + ... + 12530457.
It is an arithmetic number, because the mean of its divisors is an integer number (221019890).
Almost surely, 211064004128 is an apocalyptic number.
11064004128 is a gapful number since it is divisible by the number (18) 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 11064004128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15913432080).
11064004128 is an abundant number, since it is smaller than the sum of its proper divisors (20762860032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11064004128 is a wasteful number, since it uses less digits than its factorization.
11064004128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1351 (or 1340 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The spelling of 11064004128 in words is "eleven billion, sixty-four million, four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •