Base | Representation |
---|---|
bin | 10110100011101010… |
… | …01111100100000101 |
3 | 1011020222201111211002 |
4 | 23101311033210011 |
5 | 144300221030432 |
6 | 5321410223045 |
7 | 606051051614 |
oct | 132165174405 |
9 | 34228644732 |
10 | 12110330117 |
11 | 5154a69296 |
12 | 241b884a85 |
13 | 11acc84212 |
14 | 82c53b87b |
15 | 4ad2b5e62 |
hex | 2d1d4f905 |
12110330117 has 2 divisors, whose sum is σ = 12110330118. Its totient is φ = 12110330116.
The previous prime is 12110330087. The next prime is 12110330173. The reversal of 12110330117 is 71103301121.
12110330117 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9431128996 + 2679201121 = 97114^2 + 51761^2 .
It is a cyclic number.
It is not a de Polignac number, because 12110330117 - 210 = 12110329093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12110230117) 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, 6055165058 + 6055165059.
It is an arithmetic number, because the mean of its divisors is an integer number (6055165059).
Almost surely, 212110330117 is an apocalyptic number.
It is an amenable number.
12110330117 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110330117 is an equidigital number, since it uses as much as digits as its factorization.
12110330117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 20.
Adding to 12110330117 its reverse (71103301121), we get a palindrome (83213631238).
The spelling of 12110330117 in words is "twelve billion, one hundred ten million, three hundred thirty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •