Base | Representation |
---|---|
bin | 11101000110110101010… |
… | …101110111001111001010 |
3 | 21002012212112022200020100 |
4 | 131012311111313033022 |
5 | 230232403230400020 |
6 | 4130514042510230 |
7 | 264336606114330 |
oct | 35066525671712 |
9 | 7065775280210 |
10 | 2000202200010 |
11 | 70130aaa6733 |
12 | 28379b805376 |
13 | 11680640bb51 |
14 | 6cb4b685b50 |
15 | 3706ab1da90 |
hex | 1d1b55773ca |
2000202200010 has 192 divisors, whose sum is σ = 6021680071680. Its totient is φ = 451177758720.
The previous prime is 2000202199979. The next prime is 2000202200023. The reversal of 2000202200010 is 100022020002.
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 = 2000202199965 and 2000202200001.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 113118370 + ... + 113136050.
It is an arithmetic number, because the mean of its divisors is an integer number (31362917040).
Almost surely, 22000202200010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2000202200010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3010840035840).
2000202200010 is an abundant number, since it is smaller than the sum of its proper divisors (4021477871670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000202200010 is a wasteful number, since it uses less digits than its factorization.
2000202200010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20053 (or 20050 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 2000202200010 its reverse (100022020002), we get a palindrome (2100224220012).
The spelling of 2000202200010 in words is "two trillion, two hundred two million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •