Search a number
-
+
10651610161 is a prime number
BaseRepresentation
bin10011110101110001…
…01010110000110001
31000111022212212020001
421322320222300301
5133303303011121
64520540550001
7524646123013
oct117270526061
930438785201
1010651610161
114576613405
122093252301
1310099b630a
147309021b3
154251c2991
hex27ae2ac31

10651610161 has 2 divisors, whose sum is σ = 10651610162. Its totient is φ = 10651610160.

The previous prime is 10651610153. The next prime is 10651610183. The reversal of 10651610161 is 16101615601.

10651610161 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., 8266264561 + 2385345600 = 90919^2 + 48840^2 .

It is a cyclic number.

It is not a de Polignac number, because 10651610161 - 23 = 10651610153 is a prime.

It is a super-2 number, since 2×106516101612 (a number of 21 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (10651610111) 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, 5325805080 + 5325805081.

It is an arithmetic number, because the mean of its divisors is an integer number (5325805081).

Almost surely, 210651610161 is an apocalyptic number.

It is an amenable number.

10651610161 is a deficient number, since it is larger than the sum of its proper divisors (1).

10651610161 is an equidigital number, since it uses as much as digits as its factorization.

10651610161 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 1080, while the sum is 28.

The spelling of 10651610161 in words is "ten billion, six hundred fifty-one million, six hundred ten thousand, one hundred sixty-one".