Base | Representation |
---|---|
bin | 11101101110001011000… |
… | …01000010100110010101 |
3 | 10121121221122112001011120 |
4 | 32313011201002212111 |
5 | 113212430040201401 |
6 | 2101050434354153 |
7 | 133531544315100 |
oct | 16670541024625 |
9 | 3547848461146 |
10 | 1021221022101 |
11 | 364108709995 |
12 | 145b04a2b959 |
13 | 753ba918357 |
14 | 375da971737 |
15 | 1b86e7c1836 |
hex | edc5842995 |
1021221022101 has 12 divisors (see below), whose sum is σ = 1583934646752. Its totient is φ = 583554869688.
The previous prime is 1021221022061. The next prime is 1021221022111. The reversal of 1021221022101 is 1012201221201.
It is not a de Polignac number, because 1021221022101 - 27 = 1021221021973 is a prime.
It is a super-2 number, since 2×10212210221012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1021221022111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3473540745 + ... + 3473541038.
It is an arithmetic number, because the mean of its divisors is an integer number (131994553896).
Almost surely, 21021221022101 is an apocalyptic number.
It is an amenable number.
1021221022101 is a deficient number, since it is larger than the sum of its proper divisors (562713624651).
1021221022101 is an equidigital number, since it uses as much as digits as its factorization.
1021221022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6947081800 (or 6947081793 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1021221022101 its reverse (1012201221201), we get a palindrome (2033422243302).
The spelling of 1021221022101 in words is "one trillion, twenty-one billion, two hundred twenty-one million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •