Base | Representation |
---|---|
bin | 1011110000100001000… |
… | …0100000111110100100 |
3 | 201022101212102022221200 |
4 | 2330020100200332210 |
5 | 11302200003310040 |
6 | 232444244042500 |
7 | 20410540516626 |
oct | 2741020407644 |
9 | 638355368850 |
10 | 202002010020 |
11 | 78739960a38 |
12 | 33196093430 |
13 | 1608301b3a5 |
14 | 9ac3d40c16 |
15 | 53c40d2630 |
hex | 2f08420fa4 |
202002010020 has 36 divisors (see below), whose sum is σ = 612739430940. Its totient is φ = 53867202624.
The previous prime is 202002009997. The next prime is 202002010033. The reversal of 202002010020 is 20010200202.
It can be written as a sum of positive squares in 2 ways, for example, as 140251748004 + 61750262016 = 374502^2 + 248496^2 .
It is a tau number, because it is divible by the number of its divisors (36).
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 = 202002009984 and 202002010011.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 561116515 + ... + 561116874.
Almost surely, 2202002010020 is an apocalyptic number.
202002010020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202002010020 is an abundant number, since it is smaller than the sum of its proper divisors (410737420920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202002010020 is a wasteful number, since it uses less digits than its factorization.
202002010020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1122233404 (or 1122233399 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 202002010020 its reverse (20010200202), we get a palindrome (222012210222).
The spelling of 202002010020 in words is "two hundred two billion, two million, ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •