Base | Representation |
---|---|
bin | 10011000000000011… |
… | …10011011100110010 |
3 | 222022221000112000100 |
4 | 21200001303130302 |
5 | 131342430121320 |
6 | 4404123133230 |
7 | 510535145463 |
oct | 114001633462 |
9 | 28287015010 |
10 | 10201020210 |
11 | 4365234517 |
12 | 1b88374216 |
13 | c67540c44 |
14 | 6cab2cd6a |
15 | 3ea869790 |
hex | 260073732 |
10201020210 has 24 divisors (see below), whose sum is σ = 26522652780. Its totient is φ = 2720272032.
The previous prime is 10201020197. The next prime is 10201020223. The reversal of 10201020210 is 1202010201.
It is an interprime number because it is at equal distance from previous prime (10201020197) and next prime (10201020223).
It can be written as a sum of positive squares in 2 ways, for example, as 9877775769 + 323244441 = 99387^2 + 17979^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10201020192 and 10201020201.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56672245 + ... + 56672424.
Almost surely, 210201020210 is an apocalyptic number.
10201020210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10201020210 is an abundant number, since it is smaller than the sum of its proper divisors (16321632570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201020210 is a wasteful number, since it uses less digits than its factorization.
10201020210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113344682 (or 113344679 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10201020210 its reverse (1202010201), we get a palindrome (11403030411).
The spelling of 10201020210 in words is "ten billion, two hundred one million, twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •