Search a number
-
+
110056005071 is a prime number
BaseRepresentation
bin110011001111111011…
…0010101110111001111
3101112001222210022212222
41212133312111313033
53300343314130241
6122320430045555
710644201415355
oct1463766256717
9345058708788
10110056005071
11427468225a1
12193b56498bb
13a4bbca86bc
1454808017d5
152ce1eaba4b
hex199fd95dcf

110056005071 has 2 divisors, whose sum is σ = 110056005072. Its totient is φ = 110056005070.

The previous prime is 110056005049. The next prime is 110056005107. The reversal of 110056005071 is 170500650011.

Together with next prime (110056005107) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 2110056005071 is an apocalyptic number.

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

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

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

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

Adding to 110056005071 its reverse (170500650011), we get a palindrome (280556655082).

The spelling of 110056005071 in words is "one hundred ten billion, fifty-six million, five thousand, seventy-one".