Base | Representation |
---|---|
bin | 11101101111101001001… |
… | …11010111110101011101 |
3 | 10121200222201101210200211 |
4 | 32313310213113311131 |
5 | 113221034332223401 |
6 | 2101301103052421 |
7 | 133560250650106 |
oct | 16676447276535 |
9 | 3550881353624 |
10 | 1022011211101 |
11 | 364483759651 |
12 | 1460a55a1111 |
13 | 754b55446ca |
14 | 376738a53ad |
15 | 1b8b8d5b951 |
hex | edf49d7d5d |
1022011211101 has 8 divisors (see below), whose sum is σ = 1023164684640. Its totient is φ = 1020858352848.
The previous prime is 1022011211077. The next prime is 1022011211131. The reversal of 1022011211101 is 1011121102201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1022011211101 - 27 = 1022011210973 is a prime.
It is a super-3 number, since 3×10220112111013 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022011211131) 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, 3211510 + ... + 3515368.
It is an arithmetic number, because the mean of its divisors is an integer number (127895585580).
Almost surely, 21022011211101 is an apocalyptic number.
It is an amenable number.
1022011211101 is a deficient number, since it is larger than the sum of its proper divisors (1153473539).
1022011211101 is a wasteful number, since it uses less digits than its factorization.
1022011211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307643.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1022011211101 its reverse (1011121102201), we get a palindrome (2033132313302).
The spelling of 1022011211101 in words is "one trillion, twenty-two billion, eleven million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •