Base | Representation |
---|---|
bin | 1011000110110010010000… |
… | …1111010010111101010111 |
3 | 1121020101020112011100120112 |
4 | 2301230210033102331113 |
5 | 3100032014200341434 |
6 | 41545425311153235 |
7 | 2400141630340043 |
oct | 261544417227527 |
9 | 47211215140515 |
10 | 12211200012119 |
11 | 3988817074969 |
12 | 145274221581b |
13 | 6a76851c6064 |
14 | 30304d357023 |
15 | 162994791dce |
hex | b1b243d2f57 |
12211200012119 has 8 divisors (see below), whose sum is σ = 12265115793840. Its totient is φ = 12157297112896.
The previous prime is 12211200012103. The next prime is 12211200012131. The reversal of 12211200012119 is 91121000211221.
It is a happy number.
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 12211200012119 - 24 = 12211200012103 is a prime.
It is a super-2 number, since 2×122112000121192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12211200012094 and 12211200012103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12211200012149) 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, 1318184 + ... + 5114685.
It is an arithmetic number, because the mean of its divisors is an integer number (1533139474230).
Almost surely, 212211200012119 is an apocalyptic number.
12211200012119 is a deficient number, since it is larger than the sum of its proper divisors (53915781721).
12211200012119 is an equidigital number, since it uses as much as digits as its factorization.
12211200012119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6441249.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 12211200012119 in words is "twelve trillion, two hundred eleven billion, two hundred million, twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •