Base | Representation |
---|---|
bin | 101000110110… |
… | …100001001000 |
3 | 202011002002000 |
4 | 220312201020 |
5 | 10220142224 |
6 | 1021311000 |
7 | 160011522 |
oct | 50664110 |
9 | 22132060 |
10 | 10709064 |
11 | 6054973 |
12 | 3705460 |
13 | 22ac532 |
14 | 15caa12 |
15 | e180c9 |
hex | a36848 |
10709064 has 64 divisors (see below), whose sum is σ = 30465600. Its totient is φ = 3483648.
The previous prime is 10709059. The next prime is 10709093. The reversal of 10709064 is 46090701.
It is a super-3 number, since 3×107090643 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
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, 8712 + ... + 9864.
It is an arithmetic number, because the mean of its divisors is an integer number (476025).
Almost surely, 210709064 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 10709064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15232800).
10709064 is an abundant number, since it is smaller than the sum of its proper divisors (19756536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10709064 is a wasteful number, since it uses less digits than its factorization.
10709064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1211 (or 1201 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The square root of 10709064 is about 3272.4706263006. The cubic root of 10709064 is about 220.4197495925.
Adding to 10709064 its reverse (46090701), we get a palindrome (56799765).
The spelling of 10709064 in words is "ten million, seven hundred nine thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •