Base | Representation |
---|---|
bin | 1010111011011011110110… |
… | …0110101010011101101101 |
3 | 1120112201220221210211212102 |
4 | 2232312331212222131231 |
5 | 3033333141331244031 |
6 | 41320100153544445 |
7 | 2350066515324302 |
oct | 256667546523555 |
9 | 46481827724772 |
10 | 12016204556141 |
11 | 3913053234765 |
12 | 14209a2715125 |
13 | 69217a966b46 |
14 | 2d7831b9b0a9 |
15 | 15c8808707cb |
hex | aedbd9aa76d |
12016204556141 has 4 divisors (see below), whose sum is σ = 12403824057984. Its totient is φ = 11628585054300.
The previous prime is 12016204556113. The next prime is 12016204556183. The reversal of 12016204556141 is 14165540261021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12016204556141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12016204556095 and 12016204556104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12016204556101) 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, 193809750875 + ... + 193809750936.
It is an arithmetic number, because the mean of its divisors is an integer number (3100956014496).
Almost surely, 212016204556141 is an apocalyptic number.
It is an amenable number.
12016204556141 is a deficient number, since it is larger than the sum of its proper divisors (387619501843).
12016204556141 is an equidigital number, since it uses as much as digits as its factorization.
12016204556141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 387619501842.
The product of its (nonzero) digits is 57600, while the sum is 38.
The spelling of 12016204556141 in words is "twelve trillion, sixteen billion, two hundred four million, five hundred fifty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •