Base | Representation |
---|---|
bin | 10011000000101001… |
… | …10100111101010000 |
3 | 222100021101212202201 |
4 | 21200110310331100 |
5 | 131400214211440 |
6 | 4404422052544 |
7 | 510625425541 |
oct | 114024647520 |
9 | 28307355681 |
10 | 10206007120 |
11 | 4368030231 |
12 | 1b89b7a154 |
13 | c68598a8a |
14 | 6cb66a4c8 |
15 | 3eb00219a |
hex | 260534f50 |
10206007120 has 160 divisors (see below), whose sum is σ = 27123621120. Its totient is φ = 3548160000.
The previous prime is 10206007087. The next prime is 10206007121. The reversal of 10206007120 is 2170060201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10206007121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 901495 + ... + 912745.
It is an arithmetic number, because the mean of its divisors is an integer number (169522632).
Almost surely, 210206007120 is an apocalyptic number.
10206007120 is a gapful number since it is divisible by the number (10) 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 10206007120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13561810560).
10206007120 is an abundant number, since it is smaller than the sum of its proper divisors (16917614000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10206007120 is a wasteful number, since it uses less digits than its factorization.
10206007120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11333 (or 11327 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 10206007120 its reverse (2170060201), we get a palindrome (12376067321).
The spelling of 10206007120 in words is "ten billion, two hundred six million, seven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •