Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …0101100011111111110101 |
3 | 1100012000220002221121102011 |
4 | 2110232032011203333311 |
5 | 2314421241410120041 |
6 | 33423015412044221 |
7 | 2103243610215610 |
oct | 224561605437765 |
9 | 40160802847364 |
10 | 10220111020021 |
11 | 3290363262221 |
12 | 1190886603671 |
13 | 5919a1b53a36 |
14 | 274928155177 |
15 | 12acadc62e81 |
hex | 94b8e163ff5 |
10220111020021 has 8 divisors (see below), whose sum is σ = 11681391173760. Its totient is φ = 8759146939728.
The previous prime is 10220111019997. The next prime is 10220111020069. The reversal of 10220111020021 is 12002011102201.
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 10220111020021 - 213 = 10220111011829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10220111019983 and 10220111020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220111020321) 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, 78949066 + ... + 79078411.
It is an arithmetic number, because the mean of its divisors is an integer number (1460173896720).
Almost surely, 210220111020021 is an apocalyptic number.
It is an amenable number.
10220111020021 is a deficient number, since it is larger than the sum of its proper divisors (1461280153739).
10220111020021 is an equidigital number, since it uses as much as digits as its factorization.
10220111020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158036723.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10220111020021 its reverse (12002011102201), we get a palindrome (22222122122222).
The spelling of 10220111020021 in words is "ten trillion, two hundred twenty billion, one hundred eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •