Base | Representation |
---|---|
bin | 11101110000000001000… |
… | …01100000101010111101 |
3 | 10121201111122100011221111 |
4 | 32320000201200222331 |
5 | 113221442004013041 |
6 | 2101333001202021 |
7 | 133565225101030 |
oct | 16700041405275 |
9 | 3551448304844 |
10 | 1022211001021 |
11 | 364576508791 |
12 | 146140490311 |
13 | 75517a571b2 |
14 | 37692231017 |
15 | 1b8cb673981 |
hex | ee00860abd |
1022211001021 has 8 divisors (see below), whose sum is σ = 1168254031680. Its totient is φ = 876171192288.
The previous prime is 1022211000947. The next prime is 1022211001067. The reversal of 1022211001021 is 1201001122201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1022211001021 - 29 = 1022211000509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022211000992 and 1022211001010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022211001321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82336 + ... + 1432201.
It is an arithmetic number, because the mean of its divisors is an integer number (146031753960).
Almost surely, 21022211001021 is an apocalyptic number.
It is an amenable number.
1022211001021 is a deficient number, since it is larger than the sum of its proper divisors (146043030659).
1022211001021 is an equidigital number, since it uses as much as digits as its factorization.
1022211001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1610963.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1022211001021 its reverse (1201001122201), we get a palindrome (2223212123222).
The spelling of 1022211001021 in words is "one trillion, twenty-two billion, two hundred eleven million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •