Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …1010000100000101010101 |
3 | 1100012000220012011120001212 |
4 | 2110232032022010011111 |
5 | 2314421242210400041 |
6 | 33423015453231205 |
7 | 2103243623232053 |
oct | 224561612040525 |
9 | 40160805146055 |
10 | 10220112200021 |
11 | 3290363998829 |
12 | 1190886a92505 |
13 | 5919a2177b69 |
14 | 2749283811d3 |
15 | 12acadde78eb |
hex | 94b8e284155 |
10220112200021 has 8 divisors (see below), whose sum is σ = 10271604669888. Its totient is φ = 10168648560000.
The previous prime is 10220112200009. The next prime is 10220112200099. The reversal of 10220112200021 is 12000221102201.
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 10220112200021 - 222 = 10220108005717 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10220112199969 and 10220112200005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220112200821) 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, 6496505 + ... + 7914846.
It is an arithmetic number, because the mean of its divisors is an integer number (1283950583736).
Almost surely, 210220112200021 is an apocalyptic number.
It is an amenable number.
10220112200021 is a deficient number, since it is larger than the sum of its proper divisors (51492469867).
10220112200021 is a wasteful number, since it uses less digits than its factorization.
10220112200021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14414923.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10220112200021 its reverse (12000221102201), we get a palindrome (22220333302222).
The spelling of 10220112200021 in words is "ten trillion, two hundred twenty billion, one hundred twelve million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •