Base | Representation |
---|---|
bin | 110010010011110… |
… | …0100110110100001 |
3 | 11100122110011121001 |
4 | 1210213210312201 |
5 | 11424123034121 |
6 | 435301432001 |
7 | 56555403103 |
oct | 14447446641 |
9 | 4318404531 |
10 | 1688096161 |
11 | 7969826a4 |
12 | 3b140b601 |
13 | 20b96c28b |
14 | 1202a7573 |
15 | 9d301991 |
hex | 649e4da1 |
1688096161 has 2 divisors, whose sum is σ = 1688096162. Its totient is φ = 1688096160.
The previous prime is 1688096159. The next prime is 1688096167. The reversal of 1688096161 is 1616908861.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1661377600 + 26718561 = 40760^2 + 5169^2 .
It is an emirp because it is prime and its reverse (1616908861) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 1919608891 and 1988069191.
It is a cyclic number.
It is not a de Polignac number, because 1688096161 - 21 = 1688096159 is a prime.
Together with 1688096159, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1688096167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 844048080 + 844048081.
It is an arithmetic number, because the mean of its divisors is an integer number (844048081).
Almost surely, 21688096161 is an apocalyptic number.
It is an amenable number.
1688096161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1688096161 is an equidigital number, since it uses as much as digits as its factorization.
1688096161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 46.
The square root of 1688096161 is about 41086.4474127418. The cubic root of 1688096161 is about 1190.6909719655.
The spelling of 1688096161 in words is "one billion, six hundred eighty-eight million, ninety-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •