Base | Representation |
---|---|
bin | 1001010010111001010000… |
… | …0011010101100111010111 |
3 | 1100012001011002021012111110 |
4 | 2110232110003111213113 |
5 | 2314421443020200434 |
6 | 33423033345110103 |
7 | 2103246233663406 |
oct | 224562403254727 |
9 | 40161132235443 |
10 | 10220211100119 |
11 | 32904047a8949 |
12 | 11908b4028333 |
13 | 5919b97c4b27 |
14 | 27493756763d |
15 | 12acb79314e9 |
hex | 94b940d59d7 |
10220211100119 has 64 divisors (see below), whose sum is σ = 14463959040000. Its totient is φ = 6405936451200.
The previous prime is 10220211100091. The next prime is 10220211100129. The reversal of 10220211100119 is 91100111202201.
10220211100119 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10220211100119 - 28 = 10220211099863 is a prime.
It is a super-2 number, since 2×102202111001192 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10220211100095 and 10220211100104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220211100129) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2952963049 + ... + 2952966509.
It is an arithmetic number, because the mean of its divisors is an integer number (225999360000).
Almost surely, 210220211100119 is an apocalyptic number.
10220211100119 is a deficient number, since it is larger than the sum of its proper divisors (4243747939881).
10220211100119 is a wasteful number, since it uses less digits than its factorization.
10220211100119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5836.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 10220211100119 in words is "ten trillion, two hundred twenty billion, two hundred eleven million, one hundred thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •