Base | Representation |
---|---|
bin | 10010101001010110… |
… | …011011111010101000 |
3 | 1220200022020021021122 |
4 | 102221112123322220 |
5 | 312000400201300 |
6 | 13110401354412 |
7 | 1306066354343 |
oct | 225126337250 |
9 | 56608207248 |
10 | 20021100200 |
11 | 8544430a02 |
12 | 3a69038a08 |
13 | 1b70b84a6a |
14 | d7d01945a |
15 | 7c2a37c85 |
hex | 4a959bea8 |
20021100200 has 96 divisors (see below), whose sum is σ = 47041911000. Its totient is φ = 7924085760.
The previous prime is 20021100199. The next prime is 20021100221. The reversal of 20021100200 is 200112002.
It can be written as a sum of positive squares in 12 ways, for example, as 790621924 + 19230478276 = 28118^2 + 138674^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8730254 + ... + 8732546.
Almost surely, 220021100200 is an apocalyptic number.
20021100200 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 20021100200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23520955500).
20021100200 is an abundant number, since it is smaller than the sum of its proper divisors (27020810800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20021100200 is a wasteful number, since it uses less digits than its factorization.
20021100200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2751 (or 2742 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 20021100200 its reverse (200112002), we get a palindrome (20221212202).
The spelling of 20021100200 in words is "twenty billion, twenty-one million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •