Base | Representation |
---|---|
bin | 101000010100… |
… | …000110000000 |
3 | 201212220122210 |
4 | 220110012000 |
5 | 10201134224 |
6 | 1014302120 |
7 | 155553453 |
oct | 50240600 |
9 | 21786583 |
10 | 10568064 |
11 | 5a68a41 |
12 | 3657940 |
13 | 22602c0 |
14 | 159149a |
15 | ddb429 |
hex | a14180 |
10568064 has 128 divisors (see below), whose sum is σ = 31701600. Its totient is φ = 3096576.
The previous prime is 10568057. The next prime is 10568083. The reversal of 10568064 is 46086501.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×105680642 = 223367953416192, which contains 22 as substring.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 144732 + ... + 144804.
Almost surely, 210568064 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 10568064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15850800).
10568064 is an abundant number, since it is smaller than the sum of its proper divisors (21133536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10568064 is a wasteful number, since it uses less digits than its factorization.
10568064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132 (or 120 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The square root of 10568064 is about 3250.8558873011. The cubic root of 10568064 is about 219.4480931912.
It can be divided in two parts, 1056806 and 4, that multiplied together give a palindrome (4227224).
The spelling of 10568064 in words is "ten million, five hundred sixty-eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •