Base | Representation |
---|---|
bin | 1001000110101010010110… |
… | …00001010011100010001010 |
3 | 2121212220101021102021020000 |
4 | 10203111023001103202022 |
5 | 10111002131401400020 |
6 | 110325035120343430 |
7 | 4134255525266352 |
oct | 443251301234212 |
9 | 77786337367200 |
10 | 20020101200010 |
11 | 641952822812a |
12 | 22b4043474b76 |
13 | b22b6c932422 |
14 | 4d2d99b67b62 |
15 | 24ab7e942090 |
hex | 12354b05388a |
20020101200010 has 160 divisors (see below), whose sum is σ = 53963454593664. Its totient is φ = 5325646320000.
The previous prime is 20020101200009. The next prime is 20020101200083. The reversal of 20020101200010 is 1000210102002.
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 = 20020101199965 and 20020101200001.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2408863755 + ... + 2408872065.
Almost surely, 220020101200010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20020101200010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26981727296832).
20020101200010 is an abundant number, since it is smaller than the sum of its proper divisors (33943353393654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20020101200010 is a wasteful number, since it uses less digits than its factorization.
20020101200010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15242 (or 15233 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20020101200010 its reverse (1000210102002), we get a palindrome (21020311302012).
The spelling of 20020101200010 in words is "twenty trillion, twenty billion, one hundred one million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •