Base | Representation |
---|---|
bin | 1011000000011011111010… |
… | …1000010011101010010001 |
3 | 1120211221200121222000011202 |
4 | 2300012332220103222101 |
5 | 3041240121001011121 |
6 | 41423345423520545 |
7 | 2356230562066445 |
oct | 260067650235221 |
9 | 46757617860152 |
10 | 12102121110161 |
11 | 3946531957405 |
12 | 143557ba59155 |
13 | 69a2c079b9a4 |
14 | 2dba62622825 |
15 | 15ec0d49240b |
hex | b01bea13a91 |
12102121110161 has 2 divisors, whose sum is σ = 12102121110162. Its totient is φ = 12102121110160.
The previous prime is 12102121110151. The next prime is 12102121110227. The reversal of 12102121110161 is 16101112120121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8461809748561 + 3640311361600 = 2908919^2 + 1907960^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12102121110161 is a prime.
It is a super-2 number, since 2×121021211101612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12102121110151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051060555080 + 6051060555081.
It is an arithmetic number, because the mean of its divisors is an integer number (6051060555081).
Almost surely, 212102121110161 is an apocalyptic number.
It is an amenable number.
12102121110161 is a deficient number, since it is larger than the sum of its proper divisors (1).
12102121110161 is an equidigital number, since it uses as much as digits as its factorization.
12102121110161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 20.
Adding to 12102121110161 its reverse (16101112120121), we get a palindrome (28203233230282).
The spelling of 12102121110161 in words is "twelve trillion, one hundred two billion, one hundred twenty-one million, one hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •