Search a number
-
+
101415569 is a prime number
BaseRepresentation
bin1100000101101…
…11101010010001
321001211110000012
412002313222101
5201430244234
614021404305
72341006133
oct602675221
9231743005
10101415569
1152279022
1229b69695
131801ac18
14d67d053
158d840ce
hex60b7a91

101415569 has 2 divisors, whose sum is σ = 101415570. Its totient is φ = 101415568.

The previous prime is 101415529. The next prime is 101415571. The reversal of 101415569 is 965514101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 72471169 + 28944400 = 8513^2 + 5380^2 .

It is an emirp because it is prime and its reverse (965514101) is a distict prime.

It is a cyclic number.

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

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

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

It is a Chen prime.

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

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

Almost surely, 2101415569 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 101415569 is about 10070.5297278743. The cubic root of 101415569 is about 466.3387925395.

The spelling of 101415569 in words is "one hundred one million, four hundred fifteen thousand, five hundred sixty-nine".