Search a number
-
+
105402205151 is a prime number
BaseRepresentation
bin110001000101001110…
…1100000001111011111
3101002001122211210112222
41202022131200033133
53211330431031101
6120230543015555
710420651650515
oct1421235401737
9332048753488
10105402205151
1140778884861
1218516b9a5bb
139c29aa2539
14515c6dc4b5
152b1d63d01b
hex188a7603df

105402205151 has 2 divisors, whose sum is σ = 105402205152. Its totient is φ = 105402205150.

The previous prime is 105402205141. The next prime is 105402205157. The reversal of 105402205151 is 151502204501.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 105402205151 - 234 = 88222335967 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2105402205151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2000, while the sum is 26.

Adding to 105402205151 its reverse (151502204501), we get a palindrome (256904409652).

The spelling of 105402205151 in words is "one hundred five billion, four hundred two million, two hundred five thousand, one hundred fifty-one".