Base | Representation |
---|---|
bin | 11101101100010011101… |
… | …10011100101101010101 |
3 | 10121112100212220220112000 |
4 | 32312021312130231111 |
5 | 113203402310013414 |
6 | 2100403235145513 |
7 | 133465000632411 |
oct | 16661166345525 |
9 | 3545325826460 |
10 | 1020220001109 |
11 | 363744659011 |
12 | 145885745299 |
13 | 7528b41153a |
14 | 37543a39d41 |
15 | 1b81198cb09 |
hex | ed89d9cb55 |
1020220001109 has 16 divisors (see below), whose sum is σ = 1513033103040. Its totient is φ = 679428438480.
The previous prime is 1020220001107. The next prime is 1020220001113. The reversal of 1020220001109 is 9011000220201.
It is not a de Polignac number, because 1020220001109 - 21 = 1020220001107 is a prime.
It is a super-2 number, since 2×10202200011092 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020220001091 and 1020220001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020220001107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19924762 + ... + 19975899.
It is an arithmetic number, because the mean of its divisors is an integer number (94564568940).
Almost surely, 21020220001109 is an apocalyptic number.
It is an amenable number.
1020220001109 is a deficient number, since it is larger than the sum of its proper divisors (492813101931).
1020220001109 is an equidigital number, since it uses as much as digits as its factorization.
1020220001109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39901617 (or 39901611 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The spelling of 1020220001109 in words is "one trillion, twenty billion, two hundred twenty million, one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •