Base | Representation |
---|---|
bin | 11101101111110011111… |
… | …10101100011111011101 |
3 | 10121201012222202021111011 |
4 | 32313321332230133131 |
5 | 113221230402223401 |
6 | 2101314040055221 |
7 | 133562422642555 |
oct | 16677176543735 |
9 | 3551188667434 |
10 | 1022101211101 |
11 | 36451a53aa13 |
12 | 14610b764511 |
13 | 754cb096649 |
14 | 37681812165 |
15 | 1b8c1bd8451 |
hex | edf9fac7dd |
1022101211101 has 32 divisors (see below), whose sum is σ = 1112560479360. Its totient is φ = 935230593024.
The previous prime is 1022101210993. The next prime is 1022101211167. The reversal of 1022101211101 is 1011121012201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1022101211101 - 27 = 1022101210973 is a prime.
It is a super-3 number, since 3×10221012111013 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022101211171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 176861830 + ... + 176867608.
It is an arithmetic number, because the mean of its divisors is an integer number (34767514980).
Almost surely, 21022101211101 is an apocalyptic number.
It is an amenable number.
1022101211101 is a deficient number, since it is larger than the sum of its proper divisors (90459268259).
1022101211101 is a wasteful number, since it uses less digits than its factorization.
1022101211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6925.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1022101211101 its reverse (1011121012201), we get a palindrome (2033222223302).
The spelling of 1022101211101 in words is "one trillion, twenty-two billion, one hundred one million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •