Base | Representation |
---|---|
bin | 10110100011101000… |
… | …11010100101101001 |
3 | 1011020222022111011111 |
4 | 23101310122211221 |
5 | 144300142110004 |
6 | 5321401430321 |
7 | 606046156162 |
oct | 132164324551 |
9 | 34228274144 |
10 | 12110113129 |
11 | 5154930264 |
12 | 241b79b3a1 |
13 | 11acc0951a |
14 | 82c4c2769 |
15 | 4ad271a04 |
hex | 2d1d1a969 |
12110113129 has 2 divisors, whose sum is σ = 12110113130. Its totient is φ = 12110113128.
The previous prime is 12110113117. The next prime is 12110113151. The reversal of 12110113129 is 92131101121.
12110113129 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (12110113151) can be obtained adding 12110113129 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11804387904 + 305725225 = 108648^2 + 17485^2 .
It is a cyclic number.
It is not a de Polignac number, because 12110113129 - 211 = 12110111081 is a prime.
It is not a weakly prime, because it can be changed into another prime (12110113189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055056564 + 6055056565.
It is an arithmetic number, because the mean of its divisors is an integer number (6055056565).
Almost surely, 212110113129 is an apocalyptic number.
It is an amenable number.
12110113129 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110113129 is an equidigital number, since it uses as much as digits as its factorization.
12110113129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 12110113129 in words is "twelve billion, one hundred ten million, one hundred thirteen thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •