Base | Representation |
---|---|
bin | 11101101111110011111… |
… | …10010001110110111011 |
3 | 10121201012222112201211210 |
4 | 32313321332101312323 |
5 | 113221230340231021 |
6 | 2101314033454203 |
7 | 133562422006533 |
oct | 16677176216673 |
9 | 3551188481753 |
10 | 1022101102011 |
11 | 36451a475a60 |
12 | 14610b711363 |
13 | 754cb058ab2 |
14 | 376817c44c3 |
15 | 1b8c1bb5e76 |
hex | edf9f91dbb |
1022101102011 has 32 divisors (see below), whose sum is σ = 1538654052096. Its totient is φ = 598116096000.
The previous prime is 1022101102003. The next prime is 1022101102019. The reversal of 1022101102011 is 1102011012201.
It is an interprime number because it is at equal distance from previous prime (1022101102003) and next prime (1022101102019).
It is not a de Polignac number, because 1022101102011 - 23 = 1022101102003 is a prime.
It is a super-3 number, since 3×10221011020113 (a number of 37 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (1022101102019) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3762745 + ... + 4025226.
It is an arithmetic number, because the mean of its divisors is an integer number (48082939128).
Almost surely, 21022101102011 is an apocalyptic number.
1022101102011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1022101102011 is a deficient number, since it is larger than the sum of its proper divisors (516552950085).
1022101102011 is a wasteful number, since it uses less digits than its factorization.
1022101102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7788123.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1022101102011 its reverse (1102011012201), we get a palindrome (2124112114212).
The spelling of 1022101102011 in words is "one trillion, twenty-two billion, one hundred one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •