Search a number
-
+
106069093957 is a prime number
BaseRepresentation
bin110001011001000110…
…1011110111001000101
3101010210010201021000101
41202302031132321011
53214212142001312
6120421044444101
710443330264661
oct1426215367105
9333703637011
10106069093957
1140a90269232
12186823a9631
13a004cba7b8
1451c30d78a1
152b5be6ea57
hex18b235ee45

106069093957 has 2 divisors, whose sum is σ = 106069093958. Its totient is φ = 106069093956.

The previous prime is 106069093919. The next prime is 106069094003. The reversal of 106069093957 is 759390960601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 101959514721 + 4109579236 = 319311^2 + 64106^2 .

It is a cyclic number.

It is not a de Polignac number, because 106069093957 - 219 = 106068569669 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 106069093898 and 106069093907.

It is a congruent number.

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

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

Almost surely, 2106069093957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2755620, while the sum is 55.

The spelling of 106069093957 in words is "one hundred six billion, sixty-nine million, ninety-three thousand, nine hundred fifty-seven".