Search a number
-
+
106675525393 is a prime number
BaseRepresentation
bin110001101011001011…
…0110101011100010001
3101012100101211011112221
41203112112311130101
53221432413303033
6121001150421041
710464343001443
oct1432626653421
9335311734487
10106675525393
114127160a138
1218811501781
13a0a0828878
14523d876493
152b9530d12d
hex18d65b5711

106675525393 has 2 divisors, whose sum is σ = 106675525394. Its totient is φ = 106675525392.

The previous prime is 106675525381. The next prime is 106675525447. The reversal of 106675525393 is 393525576601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 89674494849 + 17001030544 = 299457^2 + 130388^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×1066755253932 (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 106675525393.

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

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

Almost surely, 2106675525393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5103000, while the sum is 52.

The spelling of 106675525393 in words is "one hundred six billion, six hundred seventy-five million, five hundred twenty-five thousand, three hundred ninety-three".