Base | Representation |
---|---|
bin | 1000001101101… |
… | …10110010110001 |
3 | 11210122210111001 |
4 | 10012312302301 |
5 | 120114444121 |
6 | 10500522001 |
7 | 1464456412 |
oct | 406666261 |
9 | 153583431 |
10 | 68906161 |
11 | 35994245 |
12 | 1b0b0301 |
13 | 1137799c |
14 | 9219809 |
15 | 60b1991 |
hex | 41b6cb1 |
68906161 has 2 divisors, whose sum is σ = 68906162. Its totient is φ = 68906160.
The previous prime is 68906153. The next prime is 68906177. The reversal of 68906161 is 16160986.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 41280625 + 27625536 = 6425^2 + 5256^2 .
It is a cyclic number.
It is not a de Polignac number, because 68906161 - 23 = 68906153 is a prime.
It is a Chen prime.
It is a plaindrome in base 13.
It is a self number, because there is not a number n which added to its sum of digits gives 68906161.
It is not a weakly prime, because it can be changed into another prime (68906111) 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, 34453080 + 34453081.
It is an arithmetic number, because the mean of its divisors is an integer number (34453081).
Almost surely, 268906161 is an apocalyptic number.
It is an amenable number.
68906161 is a deficient number, since it is larger than the sum of its proper divisors (1).
68906161 is an equidigital number, since it uses as much as digits as its factorization.
68906161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 37.
The square root of 68906161 is about 8300.9734971267. The cubic root of 68906161 is about 409.9705729425.
The spelling of 68906161 in words is "sixty-eight million, nine hundred six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •