Base | Representation |
---|---|
bin | 101010001100… |
… | …001101100000 |
3 | 202210220120000 |
4 | 222030031200 |
5 | 10312410224 |
6 | 1033020000 |
7 | 163003041 |
oct | 52141540 |
9 | 22726500 |
10 | 11060064 |
11 | 6274654 |
12 | 3854600 |
13 | 23a3222 |
14 | 167c8c8 |
15 | e870c9 |
hex | a8c360 |
11060064 has 120 divisors (see below), whose sum is σ = 34577928. Its totient is φ = 3456000.
The previous prime is 11060059. The next prime is 11060069. The reversal of 11060064 is 46006011.
11060064 is a `hidden beast` number, since 1 + 1 + 0 + 600 + 64 = 666.
It is an interprime number because it is at equal distance from previous prime (11060059) and next prime (11060069).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11060069) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 43939 + ... + 44189.
Almost surely, 211060064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11060064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17288964).
11060064 is an abundant number, since it is smaller than the sum of its proper divisors (23517864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11060064 is a wasteful number, since it uses less digits than its factorization.
11060064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290 (or 273 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 11060064 is about 3325.6674518057. The cubic root of 11060064 is about 222.8020658484.
Adding to 11060064 its reverse (46006011), we get a palindrome (57066075).
The spelling of 11060064 in words is "eleven million, sixty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •