Base | Representation |
---|---|
bin | 10011000000101100… |
… | …10101000000001000 |
3 | 222100022010212102002 |
4 | 21200112111000020 |
5 | 131400314304040 |
6 | 4404434330132 |
7 | 510631654511 |
oct | 114026250010 |
9 | 28308125362 |
10 | 10206400520 |
11 | 4368279858 |
12 | 1b8a129948 |
13 | c686a5b64 |
14 | 6cb72da08 |
15 | 3eb07da15 |
hex | 260595008 |
10206400520 has 32 divisors (see below), whose sum is σ = 23287849920. Its totient is φ = 4025058240.
The previous prime is 10206400513. The next prime is 10206400553. The reversal of 10206400520 is 2500460201.
It is a happy number.
It is a super-2 number, since 2×102064005202 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 10206400492 and 10206400501.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1794062 + ... + 1799741.
It is an arithmetic number, because the mean of its divisors is an integer number (727745310).
Almost surely, 210206400520 is an apocalyptic number.
10206400520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10206400520 is an abundant number, since it is smaller than the sum of its proper divisors (13081449400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10206400520 is a wasteful number, since it uses less digits than its factorization.
10206400520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3593885 (or 3593881 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 10206400520 its reverse (2500460201), we get a palindrome (12706860721).
The spelling of 10206400520 in words is "ten billion, two hundred six million, four hundred thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •