Search a number
-
+
10132311169 is a prime number
BaseRepresentation
bin10010110111110111…
…01100110010000001
3222011010201201221001
421123323230302001
5131222332424134
64353230332001
7506042136541
oct113373546201
928133651831
1010132311169
11432a475392
121b6935a001
13c56234bc6
146c1965321
153e47e6414
hex25beecc81

10132311169 has 2 divisors, whose sum is σ = 10132311170. Its totient is φ = 10132311168.

The previous prime is 10132311109. The next prime is 10132311173. The reversal of 10132311169 is 96111323101.

10132311169 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9860490000 + 271821169 = 99300^2 + 16487^2 .

It is an emirp because it is prime and its reverse (96111323101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10132311169 - 219 = 10131786881 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10132311109) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5066155584 + 5066155585.

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

Almost surely, 210132311169 is an apocalyptic number.

It is an amenable number.

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

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

10132311169 is an evil number, because the sum of its binary digits is even.

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

The spelling of 10132311169 in words is "ten billion, one hundred thirty-two million, three hundred eleven thousand, one hundred sixty-nine".