Search a number
-
+
105425554051 is a prime number
BaseRepresentation
bin110001000101111011…
…0100100101010000011
3101002010021210001020001
41202023312210222003
53211402420212201
6120233135300431
710421354265226
oct1421366445203
9332107701201
10105425554051
114078aa82174
121852297a717
139c3188905c
1451618595bd
152b20701301
hex188bda4a83

105425554051 has 2 divisors, whose sum is σ = 105425554052. Its totient is φ = 105425554050.

The previous prime is 105425554033. The next prime is 105425554079. The reversal of 105425554051 is 150455524501.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 105425554051 - 27 = 105425553923 is a prime.

It is a super-2 number, since 2×1054255540512 (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 105425554051.

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

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

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

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

Almost surely, 2105425554051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 100000, while the sum is 37.

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