Base | Representation |
---|---|
bin | 100001011010001… |
… | …0100000111110001 |
3 | 2220010101012211212 |
4 | 1002310110013301 |
5 | 4243434311121 |
6 | 303123045505 |
7 | 36531300125 |
oct | 10264240761 |
9 | 2803335755 |
10 | 1121010161 |
11 | 525865587 |
12 | 273510895 |
13 | 14b328b2b |
14 | a8c4b585 |
15 | 6863625b |
hex | 42d141f1 |
1121010161 has 2 divisors, whose sum is σ = 1121010162. Its totient is φ = 1121010160.
The previous prime is 1121010139. The next prime is 1121010181. The reversal of 1121010161 is 1610101211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 672883600 + 448126561 = 25940^2 + 21169^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121010161 - 210 = 1121009137 is a prime.
It is not a weakly prime, because it can be changed into another prime (1121010181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560505080 + 560505081.
It is an arithmetic number, because the mean of its divisors is an integer number (560505081).
Almost surely, 21121010161 is an apocalyptic number.
It is an amenable number.
1121010161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121010161 is an equidigital number, since it uses as much as digits as its factorization.
1121010161 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 1121010161 is about 33481.4898264698. The cubic root of 1121010161 is about 1038.8109441127.
Adding to 1121010161 its reverse (1610101211), we get a palindrome (2731111372).
The spelling of 1121010161 in words is "one billion, one hundred twenty-one million, ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •