Search a number
-
+
105915701 is a prime number
BaseRepresentation
bin1100101000000…
…10010100110101
321101022002000202
412110002110311
5204103300301
614302050245
72424161063
oct624022465
9241262022
10105915701
1154872041
122b579985
1318c35318
14100d1033
15947266b
hex6502535

105915701 has 2 divisors, whose sum is σ = 105915702. Its totient is φ = 105915700.

The previous prime is 105915673. The next prime is 105915707. The reversal of 105915701 is 107519501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 90744676 + 15171025 = 9526^2 + 3895^2 .

It is a cyclic number.

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

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

It is equal to p6082256 and since 105915701 and 6082256 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

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

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

Almost surely, 2105915701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1575, while the sum is 29.

The square root of 105915701 is about 10291.5354053708. The cubic root of 105915701 is about 473.1368581622.

The spelling of 105915701 in words is "one hundred five million, nine hundred fifteen thousand, seven hundred one".