Base | Representation |
---|---|
bin | 1011000000111110001111… |
… | …0001001110100100000001 |
3 | 1120212211110200220102102002 |
4 | 2300033203301032210001 |
5 | 3041413003014441121 |
6 | 41431511535033345 |
7 | 2360005102414304 |
oct | 260174361164401 |
9 | 46784420812362 |
10 | 12111334140161 |
11 | 394a42a420193 |
12 | 143731136b855 |
13 | 69b12b419029 |
14 | 2dc29804cb3b |
15 | 16009c1ede0b |
hex | b03e3c4e901 |
12111334140161 has 2 divisors, whose sum is σ = 12111334140162. Its totient is φ = 12111334140160.
The previous prime is 12111334140133. The next prime is 12111334140167. The reversal of 12111334140161 is 16104143311121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6744902439025 + 5366431701136 = 2597095^2 + 2316556^2 .
It is a cyclic number.
It is not a de Polignac number, because 12111334140161 - 26 = 12111334140097 is a prime.
It is not a weakly prime, because it can be changed into another prime (12111334140167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055667070080 + 6055667070081.
It is an arithmetic number, because the mean of its divisors is an integer number (6055667070081).
Almost surely, 212111334140161 is an apocalyptic number.
It is an amenable number.
12111334140161 is a deficient number, since it is larger than the sum of its proper divisors (1).
12111334140161 is an equidigital number, since it uses as much as digits as its factorization.
12111334140161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 29.
Adding to 12111334140161 its reverse (16104143311121), we get a palindrome (28215477451282).
The spelling of 12111334140161 in words is "twelve trillion, one hundred eleven billion, three hundred thirty-four million, one hundred forty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •