Search a number
-
+
106051397 is a prime number
BaseRepresentation
bin1100101001000…
…11011101000101
321101112222011112
412110203131011
5204122121042
614305014405
72425264514
oct624433505
9241488145
10106051397
1154954a91
122b624405
1318c8200a
141012867b
15949c982
hex6523745

106051397 has 2 divisors, whose sum is σ = 106051398. Its totient is φ = 106051396.

The previous prime is 106051391. The next prime is 106051427. The reversal of 106051397 is 793150601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 91565761 + 14485636 = 9569^2 + 3806^2 .

It is a cyclic number.

It is not a de Polignac number, because 106051397 - 24 = 106051381 is a prime.

It is a super-2 number, since 2×1060513972 = 22493797611303218, which contains 22 as substring.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 2106051397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 32.

The square root of 106051397 is about 10298.1258974631. The cubic root of 106051397 is about 473.3388281559.

The spelling of 106051397 in words is "one hundred six million, fifty-one thousand, three hundred ninety-seven".