Search a number
-
+
104015969 is a prime number
BaseRepresentation
bin1100011001100…
…10100001100001
321020201120002022
412030302201201
5203112002334
614153231225
72402056361
oct614624141
9236646068
10104015969
1153794812
122aa02515
131871b715
14db589a1
1591e982e
hex6332861

104015969 has 2 divisors, whose sum is σ = 104015970. Its totient is φ = 104015968.

The previous prime is 104015941. The next prime is 104015981. The reversal of 104015969 is 969510401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97318225 + 6697744 = 9865^2 + 2588^2 .

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

It is a cyclic number.

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

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

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

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

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

Almost surely, 2104015969 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 104015969 is about 10198.8219417735. The cubic root of 104015969 is about 470.2910058403.

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