Base | Representation |
---|---|
bin | 1011000010101001011110… |
… | …0111100101001101110001 |
3 | 1120222120202221001101021201 |
4 | 2300222113213211031301 |
5 | 3042400432024023121 |
6 | 41453032244051201 |
7 | 2362044344355301 |
oct | 260522747451561 |
9 | 46876687041251 |
10 | 12140121314161 |
11 | 3960661a98085 |
12 | 1440a06093b01 |
13 | 6a0a684489b9 |
14 | 2dd829389601 |
15 | 160bd4606e91 |
hex | b0a979e5371 |
12140121314161 has 2 divisors, whose sum is σ = 12140121314162. Its totient is φ = 12140121314160.
The previous prime is 12140121314047. The next prime is 12140121314177. The reversal of 12140121314161 is 16141312104121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8526487600225 + 3613633713936 = 2920015^2 + 1900956^2 .
It is a cyclic number.
It is not a de Polignac number, because 12140121314161 - 225 = 12140087759729 is a prime.
It is not a weakly prime, because it can be changed into another prime (12140121314861) 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 as a sum of consecutive naturals, namely, 6070060657080 + 6070060657081.
It is an arithmetic number, because the mean of its divisors is an integer number (6070060657081).
Almost surely, 212140121314161 is an apocalyptic number.
It is an amenable number.
12140121314161 is a deficient number, since it is larger than the sum of its proper divisors (1).
12140121314161 is an equidigital number, since it uses as much as digits as its factorization.
12140121314161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
Adding to 12140121314161 its reverse (16141312104121), we get a palindrome (28281433418282).
The spelling of 12140121314161 in words is "twelve trillion, one hundred forty billion, one hundred twenty-one million, three hundred fourteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •