Search a number
-
+
101367809 is a prime number
BaseRepresentation
bin1100000101011…
…00000000000001
321001202000111022
412002230000001
5201422232214
614020355225
72340416654
oct602540001
9231660438
10101367809
1152246154
1229b45b15
131800226a
14d66989b
158d74d8e
hex60ac001

101367809 has 2 divisors, whose sum is σ = 101367810. Its totient is φ = 101367808.

The previous prime is 101367803. The next prime is 101367811. The reversal of 101367809 is 908763101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91776400 + 9591409 = 9580^2 + 3097^2 .

It is a cyclic number.

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

Together with 101367811, it forms a pair of twin primes.

It is a Chen prime.

It is equal to p5835680 and since 101367809 and 5835680 have the same sum of digits, it is a Honaker prime.

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

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

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

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

It is a Proth number, since it is equal to 6187 ⋅ 214 + 1 and 6187 < 214.

Almost surely, 2101367809 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9072, while the sum is 35.

The square root of 101367809 is about 10068.1581731715. The cubic root of 101367809 is about 466.2655761746.

The spelling of 101367809 in words is "one hundred one million, three hundred sixty-seven thousand, eight hundred nine".