Search a number
-
+
169021313 is a prime number
BaseRepresentation
bin10100001001100…
…00111110000001
3102210001011122122
422010300332001
5321232140223
624434414025
74121441336
oct1204607601
9383034578
10169021313
118745423a
1248731315
132902ba16
141863a98d
15ec8a5c8
hexa130f81

169021313 has 2 divisors, whose sum is σ = 169021314. Its totient is φ = 169021312.

The previous prime is 169021277. The next prime is 169021337. The reversal of 169021313 is 313120961.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 165456769 + 3564544 = 12863^2 + 1888^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 169021313 - 222 = 164827009 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 2169021313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 169021313 is about 13000.8197049263. The cubic root of 169021313 is about 552.9007219644.

The spelling of 169021313 in words is "one hundred sixty-nine million, twenty-one thousand, three hundred thirteen".