Search a number
-
+
106925084257 is a prime number
BaseRepresentation
bin110001110010100111…
…0110100111001100001
3101012222210102001221211
41203211032310321201
53222440310144012
6121042023350121
710503463135345
oct1434516647141
9335883361854
10106925084257
114138a471432
1218880bb2341
13a110445534
145264a79625
152bac1a66a7
hex18e53b4e61

106925084257 has 2 divisors, whose sum is σ = 106925084258. Its totient is φ = 106925084256.

The previous prime is 106925084197. The next prime is 106925084267. The reversal of 106925084257 is 752480529601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 98295417441 + 8629666816 = 313521^2 + 92896^2 .

It is a cyclic number.

It is not a de Polignac number, because 106925084257 - 219 = 106924559969 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 106925084257.

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

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

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

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

Almost surely, 2106925084257 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1209600, while the sum is 49.

The spelling of 106925084257 in words is "one hundred six billion, nine hundred twenty-five million, eighty-four thousand, two hundred fifty-seven".