Base | Representation |
---|---|
bin | 1011000111010011001000… |
… | …0101010001101100010111 |
3 | 1121021020000100122222201222 |
4 | 2301310302011101230113 |
5 | 3100203101140413421 |
6 | 41553444541240555 |
7 | 2400603353610464 |
oct | 261646205215427 |
9 | 47236010588658 |
10 | 12220022201111 |
11 | 3991533a5904a |
12 | 14543a486315b |
13 | 6a845cb8a92a |
14 | 303648cc466b |
15 | 162d0e048cab |
hex | b1d32151b17 |
12220022201111 has 4 divisors (see below), whose sum is σ = 12220174591824. Its totient is φ = 12219869810400.
The previous prime is 12220022201083. The next prime is 12220022201113. The reversal of 12220022201111 is 11110222002221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12220022201111 - 218 = 12220021938967 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12220022201111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220022201113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76075010 + ... + 76235471.
It is an arithmetic number, because the mean of its divisors is an integer number (3055043647956).
Almost surely, 212220022201111 is an apocalyptic number.
12220022201111 is a deficient number, since it is larger than the sum of its proper divisors (152390713).
12220022201111 is an equidigital number, since it uses as much as digits as its factorization.
12220022201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152390712.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12220022201111 its reverse (11110222002221), we get a palindrome (23330244203332).
The spelling of 12220022201111 in words is "twelve trillion, two hundred twenty billion, twenty-two million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •