Base | Representation |
---|---|
bin | 1011000110001001010111… |
… | …1001100000001111101111 |
3 | 1121012022220110002120012012 |
4 | 2301202111321200033233 |
5 | 3044342023313000421 |
6 | 41540412110231435 |
7 | 2366302605643115 |
oct | 261422571401757 |
9 | 47168813076165 |
10 | 12200222000111 |
11 | 39840a3294a72 |
12 | 14505997b557b |
13 | 6a66259c9972 |
14 | 3026cb36bab5 |
15 | 162550ae795b |
hex | b1895e603ef |
12200222000111 has 4 divisors (see below), whose sum is σ = 12200346151272. Its totient is φ = 12200097848952.
The previous prime is 12200222000107. The next prime is 12200222000123. The reversal of 12200222000111 is 11100022200221.
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 12200222000111 - 22 = 12200222000107 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200222050111) 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 3 ways as a sum of consecutive naturals, for example, 61928060 + ... + 62124753.
It is an arithmetic number, because the mean of its divisors is an integer number (3050086537818).
Almost surely, 212200222000111 is an apocalyptic number.
12200222000111 is a deficient number, since it is larger than the sum of its proper divisors (124151161).
12200222000111 is an equidigital number, since it uses as much as digits as its factorization.
12200222000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124151160.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12200222000111 its reverse (11100022200221), we get a palindrome (23300244200332).
The spelling of 12200222000111 in words is "twelve trillion, two hundred billion, two hundred twenty-two million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •