Search a number
-
+
104620151351 is a prime number
BaseRepresentation
bin110000101101111011…
…0001101001000110111
3101000001011021100102102
41201123312031020313
53203230224320401
6120021204532315
710362404420342
oct1413366151067
9330034240372
10104620151351
1140407391201
12183390b109b
139b33a64001
1450c68c5459
152ac4b5d56b
hex185bd8d237

104620151351 has 2 divisors, whose sum is σ = 104620151352. Its totient is φ = 104620151350.

The previous prime is 104620151323. The next prime is 104620151353. The reversal of 104620151351 is 153151026401.

It is a strong prime.

It is a cyclic number.

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

It is a super-2 number, since 2×1046201513512 (a number of 23 digits) contains 22 as substring.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2104620151351 is an apocalyptic number.

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

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

104620151351 is an evil number, because the sum of its binary digits is even.

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

Adding to 104620151351 its reverse (153151026401), we get a palindrome (257771177752).

The spelling of 104620151351 in words is "one hundred four billion, six hundred twenty million, one hundred fifty-one thousand, three hundred fifty-one".