Base | Representation |
---|---|
bin | 1001010001110101011100… |
… | …1011101111000010000100 |
3 | 1100010022011121201122011210 |
4 | 2110131113023233002010 |
5 | 2314122204031201040 |
6 | 33410423320531420 |
7 | 2102033214243645 |
oct | 224352713570204 |
9 | 40108147648153 |
10 | 10202010022020 |
11 | 3283714767543 |
12 | 1189274620b70 |
13 | 590078a2062b |
14 | 273acc1576cc |
15 | 12a59eaa9480 |
hex | 947572ef084 |
10202010022020 has 48 divisors (see below), whose sum is σ = 28740877341120. Its totient is φ = 2703845598336.
The previous prime is 10202010021991. The next prime is 10202010022031. The reversal of 10202010022020 is 2022001020201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 10202010021987 and 10202010022005.
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, 521565375 + ... + 521584934.
It is an arithmetic number, because the mean of its divisors is an integer number (598768277940).
Almost surely, 210202010022020 is an apocalyptic number.
10202010022020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10202010022020 is an abundant number, since it is smaller than the sum of its proper divisors (18538867319100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10202010022020 is a wasteful number, since it uses less digits than its factorization.
10202010022020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1043150484 (or 1043150482 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10202010022020 its reverse (2022001020201), we get a palindrome (12224011042221).
The spelling of 10202010022020 in words is "ten trillion, two hundred two billion, ten million, twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •