Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …100010101001000011000 |
3 | 21011002222100021102221122 |
4 | 131121101130111020120 |
5 | 231043430224311300 |
6 | 4143550424024412 |
7 | 265640336200115 |
oct | 35312134251030 |
9 | 7132870242848 |
10 | 2020001010200 |
11 | 70974a9aa888 |
12 | 2875a6302108 |
13 | 118640203a54 |
14 | 6daa8d5990c |
15 | 37828d97c85 |
hex | 1d651715218 |
2020001010200 has 96 divisors (see below), whose sum is σ = 4721859500400. Its totient is φ = 803648847360.
The previous prime is 2020001010193. The next prime is 2020001010211. The reversal of 2020001010200 is 20101000202.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
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, 29793539 + ... + 29861261.
Almost surely, 22020001010200 is an apocalyptic number.
2020001010200 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 2020001010200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2360929750200).
2020001010200 is an abundant number, since it is smaller than the sum of its proper divisors (2701858490200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2020001010200 is a wasteful number, since it uses less digits than its factorization.
2020001010200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68541 (or 68532 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 2020001010200 its reverse (20101000202), we get a palindrome (2040102010402).
The spelling of 2020001010200 in words is "two trillion, twenty billion, one million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •