Base | Representation |
---|---|
bin | 1001010001110101011101… |
… | …0011010110110100110101 |
3 | 1100010022011202111010220211 |
4 | 2110131113103112310311 |
5 | 2314122210034120041 |
6 | 33410423431425421 |
7 | 2102033240235013 |
oct | 224352723266465 |
9 | 40108152433824 |
10 | 10202012020021 |
11 | 3283715901688 |
12 | 1189275225271 |
13 | 59007926cb93 |
14 | 273acc5178b3 |
15 | 12a59ed51481 |
hex | 947574d6d35 |
10202012020021 has 8 divisors (see below), whose sum is σ = 10270720857600. Its totient is φ = 10133306368848.
The previous prime is 10202012020019. The next prime is 10202012020037. The reversal of 10202012020021 is 12002021020201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10202012020021 - 21 = 10202012020019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10202012019983 and 10202012020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202013020021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5812420 + ... + 7361266.
It is an arithmetic number, because the mean of its divisors is an integer number (1283840107200).
Almost surely, 210202012020021 is an apocalyptic number.
It is an amenable number.
10202012020021 is a deficient number, since it is larger than the sum of its proper divisors (68708837579).
10202012020021 is a wasteful number, since it uses less digits than its factorization.
10202012020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1593203.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10202012020021 its reverse (12002021020201), we get a palindrome (22204033040222).
The spelling of 10202012020021 in words is "ten trillion, two hundred two billion, twelve million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •