Base | Representation |
---|---|
bin | 10110100011101001… |
… | …00001001011011011 |
3 | 1011020222100212012021 |
4 | 23101310201023123 |
5 | 144300143440443 |
6 | 5321402155311 |
7 | 606046330654 |
oct | 132164411333 |
9 | 34228325167 |
10 | 12110140123 |
11 | 5154949574 |
12 | 241b7b2b37 |
13 | 11acc188b3 |
14 | 82c4cc52b |
15 | 4ad2799ed |
hex | 2d1d212db |
12110140123 has 2 divisors, whose sum is σ = 12110140124. Its totient is φ = 12110140122.
The previous prime is 12110140117. The next prime is 12110140129. The reversal of 12110140123 is 32104101121.
12110140123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (12110140117) and next prime (12110140129).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12110140123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12110140097 and 12110140106.
It is not a weakly prime, because it can be changed into another prime (12110140129) 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, 6055070061 + 6055070062.
It is an arithmetic number, because the mean of its divisors is an integer number (6055070062).
Almost surely, 212110140123 is an apocalyptic number.
12110140123 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110140123 is an equidigital number, since it uses as much as digits as its factorization.
12110140123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 12110140123 its reverse (32104101121), we get a palindrome (44214241244).
The spelling of 12110140123 in words is "twelve billion, one hundred ten million, one hundred forty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •