Base | Representation |
---|---|
bin | 110000000001101001111101… |
… | …101010111110100100001001 |
3 | 1000200212102202200002212121010 |
4 | 300001221331222332210021 |
5 | 210141112040041213001 |
6 | 2025121044425034133 |
7 | 62330066516512056 |
oct | 6001517552764411 |
9 | 1020772680085533 |
10 | 211220010101001 |
11 | 613349a3231510 |
12 | 1b833a2a025949 |
13 | 90b1c66505545 |
14 | 3a23162a3202d |
15 | 19644b57818d6 |
hex | c01a7dabe909 |
211220010101001 has 32 divisors (see below), whose sum is σ = 307735418261376. Its totient is φ = 127801175040000.
The previous prime is 211220010100997. The next prime is 211220010101003. The reversal of 211220010101001 is 100101010022112.
It is not a de Polignac number, because 211220010101001 - 22 = 211220010100997 is a prime.
It is a super-2 number, since 2×2112200101010012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211220010101003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 884382801 + ... + 884621601.
It is an arithmetic number, because the mean of its divisors is an integer number (9616731820668).
Almost surely, 2211220010101001 is an apocalyptic number.
It is an amenable number.
211220010101001 is a deficient number, since it is larger than the sum of its proper divisors (96515408160375).
211220010101001 is a wasteful number, since it uses less digits than its factorization.
211220010101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282873.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 211220010101001 its reverse (100101010022112), we get a palindrome (311321020123113).
The spelling of 211220010101001 in words is "two hundred eleven trillion, two hundred twenty billion, ten million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •