Base | Representation |
---|---|
bin | 111100010100111… |
… | …001001101010001 |
3 | 2121112110112010112 |
4 | 330110321031101 |
5 | 4033100011121 |
6 | 244233011105 |
7 | 34036536326 |
oct | 7424711521 |
9 | 2545415115 |
10 | 1012110161 |
11 | 47a345387 |
12 | 242b53a95 |
13 | 1318ba36a |
14 | 985c0b4d |
15 | 5dcc475b |
hex | 3c539351 |
1012110161 has 2 divisors, whose sum is σ = 1012110162. Its totient is φ = 1012110160.
The previous prime is 1012110149. The next prime is 1012110191. The reversal of 1012110161 is 1610112101.
1012110161 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., 866183761 + 145926400 = 29431^2 + 12080^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012110161 - 26 = 1012110097 is a prime.
It is not a weakly prime, because it can be changed into another prime (1012110191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506055080 + 506055081.
It is an arithmetic number, because the mean of its divisors is an integer number (506055081).
Almost surely, 21012110161 is an apocalyptic number.
It is an amenable number.
1012110161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012110161 is an equidigital number, since it uses as much as digits as its factorization.
1012110161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
The square root of 1012110161 is about 31813.6788347403. The cubic root of 1012110161 is about 1004.0205339763.
Adding to 1012110161 its reverse (1610112101), we get a palindrome (2622222262).
The spelling of 1012110161 in words is "one billion, twelve million, one hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •