Base | Representation |
---|---|
bin | 1011000110001000111101… |
… | …0010000111100100001111 |
3 | 1121012022121201020210021112 |
4 | 2301202033102013210033 |
5 | 3044341311404341421 |
6 | 41540353103322235 |
7 | 2366300060365001 |
oct | 261421722074417 |
9 | 47168551223245 |
10 | 12200111012111 |
11 | 3984046679050 |
12 | 14505685b037b |
13 | 6a6608a099a9 |
14 | 3026ba71a371 |
15 | 162545ec245b |
hex | b188f48790f |
12200111012111 has 8 divisors (see below), whose sum is σ = 13341752878800. Its totient is φ = 11063892623040.
The previous prime is 12200111012093. The next prime is 12200111012113. The reversal of 12200111012111 is 11121011100221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12200111012111 - 234 = 12182931142927 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 (12200111012113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1355864696 + ... + 1355873693.
It is an arithmetic number, because the mean of its divisors is an integer number (1667719109850).
Almost surely, 212200111012111 is an apocalyptic number.
12200111012111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12200111012111 is a deficient number, since it is larger than the sum of its proper divisors (1141641866689).
12200111012111 is a wasteful number, since it uses less digits than its factorization.
12200111012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2711738809.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 12200111012111 its reverse (11121011100221), we get a palindrome (23321122112332).
The spelling of 12200111012111 in words is "twelve trillion, two hundred billion, one hundred eleven million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •