Base | Representation |
---|---|
bin | 1001001011111001011100… |
… | …0010110010000110100100 |
3 | 1022202112212112000110200101 |
4 | 2102332113002302012210 |
5 | 2310434301030431040 |
6 | 33251513231153444 |
7 | 2061462320133553 |
oct | 222762702620644 |
9 | 38675775013611 |
10 | 10100002202020 |
11 | 3244428a33575 |
12 | 1171546375884 |
13 | 583570259323 |
14 | 26cbb25a3d9a |
15 | 127ace46509a |
hex | 92f970b21a4 |
10100002202020 has 48 divisors (see below), whose sum is σ = 21709526908608. Its totient is φ = 3944908033920.
The previous prime is 10100002201973. The next prime is 10100002202033. The reversal of 10100002202020 is 2020220000101.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 10100002201988 and 10100002202006.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1287910 + ... + 4675330.
It is an arithmetic number, because the mean of its divisors is an integer number (452281810596).
Almost surely, 210100002202020 is an apocalyptic number.
10100002202020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10100002202020 is an abundant number, since it is smaller than the sum of its proper divisors (11609524706588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100002202020 is a wasteful number, since it uses less digits than its factorization.
10100002202020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3390940 (or 3390938 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10100002202020 its reverse (2020220000101), we get a palindrome (12120222202121).
The spelling of 10100002202020 in words is "ten trillion, one hundred billion, two million, two hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.264 sec. • engine limits •