Base | Representation |
---|---|
bin | 1011110000111010110… |
… | …0110110100111110000 |
3 | 201022200101210222021100 |
4 | 2330032230312213300 |
5 | 11302410141231000 |
6 | 232503104524400 |
7 | 20413322343612 |
oct | 2741654664760 |
9 | 638611728240 |
10 | 202110102000 |
11 | 7879497a054 |
12 | 33206320700 |
13 | 1609c536141 |
14 | 9ad443adb2 |
15 | 53cd834a00 |
hex | 2f0eb369f0 |
202110102000 has 240 divisors, whose sum is σ = 712763183808. Its totient is φ = 53372275200.
The previous prime is 202110101987. The next prime is 202110102011. The reversal of 202110102000 is 201011202.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1799494 + ... + 1908506.
Almost surely, 2202110102000 is an apocalyptic number.
202110102000 is a gapful number since it is divisible by the number (20) 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 202110102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (356381591904).
202110102000 is an abundant number, since it is smaller than the sum of its proper divisors (510653081808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202110102000 is a wasteful number, since it uses less digits than its factorization.
202110102000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109145 (or 109126 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 202110102000 its reverse (201011202), we get a palindrome (202311113202).
The spelling of 202110102000 in words is "two hundred two billion, one hundred ten million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •