Search a number
-
+
106037145509 is a prime number
BaseRepresentation
bin110001011000001001…
…1100110111110100101
3101010200220121002222112
41202300103212332211
53214131002124014
6120413544010405
710442461602551
oct1426023467645
9333626532875
10106037145509
1140a74227959
1218673760a05
139ccb4b29a9
1451bcb7c861
152b5925d73e
hex18b04e6fa5

106037145509 has 2 divisors, whose sum is σ = 106037145510. Its totient is φ = 106037145508.

The previous prime is 106037145451. The next prime is 106037145551. The reversal of 106037145509 is 905541730601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 103230477025 + 2806668484 = 321295^2 + 52978^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-106037145509 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2106037145509 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 113400, while the sum is 41.

The spelling of 106037145509 in words is "one hundred six billion, thirty-seven million, one hundred forty-five thousand, five hundred nine".