Base | Representation |
---|---|
bin | 10001110000011010001… |
… | …111111111000001111011 |
3 | 11022122120121110212201111 |
4 | 101300122033333001323 |
5 | 124442443021010021 |
6 | 2332320210501151 |
7 | 154104653206015 |
oct | 21603217770173 |
9 | 4278517425644 |
10 | 1220211110011 |
11 | 4305413a71a3 |
12 | 17859a2947b7 |
13 | 8b0b09397ba |
14 | 430b68851b5 |
15 | 21b192578e1 |
hex | 11c1a3ff07b |
1220211110011 has 24 divisors (see below), whose sum is σ = 1343113128000. Its totient is φ = 1105393549392.
The previous prime is 1220211110009. The next prime is 1220211110029. The reversal of 1220211110011 is 1100111120221.
It is a happy number.
It is not a de Polignac number, because 1220211110011 - 21 = 1220211110009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220211109973 and 1220211110000.
It is not an unprimeable number, because it can be changed into a prime (1220211110311) 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 23 ways as a sum of consecutive naturals, for example, 36760020 + ... + 36793198.
It is an arithmetic number, because the mean of its divisors is an integer number (55963047000).
Almost surely, 21220211110011 is an apocalyptic number.
1220211110011 is a deficient number, since it is larger than the sum of its proper divisors (122902017989).
1220211110011 is a wasteful number, since it uses less digits than its factorization.
1220211110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36903 (or 36880 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1220211110011 its reverse (1100111120221), we get a palindrome (2320322230232).
The spelling of 1220211110011 in words is "one trillion, two hundred twenty billion, two hundred eleven million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •