Base | Representation |
---|---|
bin | 11101101100010011110… |
… | …10101101111011010011 |
3 | 10121112100222000202122020 |
4 | 32312021322231323103 |
5 | 113203403101321321 |
6 | 2100403315142523 |
7 | 133465013303166 |
oct | 16661172557323 |
9 | 3545328022566 |
10 | 1020221120211 |
11 | 363745252897 |
12 | 145885ba4a43 |
13 | 7528b713a27 |
14 | 37543c4badd |
15 | 1b811b0e4c6 |
hex | ed89eaded3 |
1020221120211 has 8 divisors (see below), whose sum is σ = 1360621916160. Its totient is φ = 679983868872.
The previous prime is 1020221120201. The next prime is 1020221120221. The reversal of 1020221120211 is 1120211220201.
It is an interprime number because it is at equal distance from previous prime (1020221120201) and next prime (1020221120221).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1020221120211 - 26 = 1020221120147 is a prime.
It is a super-2 number, since 2×10202211202112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1020221120201) 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, 40871595 + ... + 40896548.
It is an arithmetic number, because the mean of its divisors is an integer number (170077739520).
Almost surely, 21020221120211 is an apocalyptic number.
1020221120211 is a deficient number, since it is larger than the sum of its proper divisors (340400795949).
1020221120211 is an equidigital number, since it uses as much as digits as its factorization.
1020221120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81772305.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1020221120211 its reverse (1120211220201), we get a palindrome (2140432340412).
The spelling of 1020221120211 in words is "one trillion, twenty billion, two hundred twenty-one million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •