Search a number
-
+
104891401 is a prime number
BaseRepresentation
bin1100100000010…
…00010000001001
321022101000221201
412100020100021
5203323011101
614224104201
72412363556
oct620102011
9238330851
10104891401
115423250a
122b165061
1318967024
14dd05a2d
15931de01
hex6408409

104891401 has 2 divisors, whose sum is σ = 104891402. Its totient is φ = 104891400.

The previous prime is 104891393. The next prime is 104891441. The reversal of 104891401 is 104198401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 76108176 + 28783225 = 8724^2 + 5365^2 .

It is a cyclic number.

It is not a de Polignac number, because 104891401 - 23 = 104891393 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 104891401.

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

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

Almost surely, 2104891401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1152, while the sum is 28.

The square root of 104891401 is about 10241.6503064692. The cubic root of 104891401 is about 471.6066953070.

The spelling of 104891401 in words is "one hundred four million, eight hundred ninety-one thousand, four hundred one".