Base | Representation |
---|---|
bin | 1011000000111001101101… |
… | …1001101100000110110001 |
3 | 1120212201100002022020011022 |
4 | 2300032123121230012301 |
5 | 3041403011210311121 |
6 | 41431151244025225 |
7 | 2356633030445555 |
oct | 260163331540661 |
9 | 46781302266138 |
10 | 12110120010161 |
11 | 3949967043368 |
12 | 1437032832215 |
13 | 69ac96a18204 |
14 | 2dc1c0ac1865 |
15 | 16002a821aab |
hex | b039b66c1b1 |
12110120010161 has 2 divisors, whose sum is σ = 12110120010162. Its totient is φ = 12110120010160.
The previous prime is 12110120010119. The next prime is 12110120010187. The reversal of 12110120010161 is 16101002101121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12058395150400 + 51724859761 = 3472520^2 + 227431^2 .
It is a cyclic number.
It is not a de Polignac number, because 12110120010161 - 26 = 12110120010097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12110120010101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055060005080 + 6055060005081.
It is an arithmetic number, because the mean of its divisors is an integer number (6055060005081).
Almost surely, 212110120010161 is an apocalyptic number.
It is an amenable number.
12110120010161 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110120010161 is an equidigital number, since it uses as much as digits as its factorization.
12110120010161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 12110120010161 its reverse (16101002101121), we get a palindrome (28211122111282).
The spelling of 12110120010161 in words is "twelve trillion, one hundred ten billion, one hundred twenty million, ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •