Base | Representation |
---|---|
bin | 11110101110000111011… |
… | …100000011110100111001 |
3 | 21110211010021101201012121 |
4 | 132232013130003310321 |
5 | 234042013403102301 |
6 | 4253454305441241 |
7 | 305344025211616 |
oct | 36560734036471 |
9 | 7424107351177 |
10 | 2111101222201 |
11 | 744349670494 |
12 | 2a118b640221 |
13 | 1240cac4c33a |
14 | 7426c00d50d |
15 | 39dabaed3a1 |
hex | 1eb87703d39 |
2111101222201 has 16 divisors (see below), whose sum is σ = 2216770416000. Its totient is φ = 2007678332800.
The previous prime is 2111101222159. The next prime is 2111101222247. The reversal of 2111101222201 is 1022221011112.
It is a cyclic number.
It is not a de Polignac number, because 2111101222201 - 217 = 2111101091129 is a prime.
It is a super-3 number, since 3×21111012222013 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2111101822201) 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 15 ways as a sum of consecutive naturals, for example, 1671186 + ... + 2648596.
It is an arithmetic number, because the mean of its divisors is an integer number (138548151000).
Almost surely, 22111101222201 is an apocalyptic number.
It is an amenable number.
2111101222201 is a deficient number, since it is larger than the sum of its proper divisors (105669193799).
2111101222201 is a wasteful number, since it uses less digits than its factorization.
2111101222201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 978560.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 2111101222201 its reverse (1022221011112), we get a palindrome (3133322233313).
The spelling of 2111101222201 in words is "two trillion, one hundred eleven billion, one hundred one million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •