Search a number
-
+
110511410131 is a prime number
BaseRepresentation
bin110011011101011111…
…1100100101111010011
3101120020201201022012001
41212322333210233103
53302311410111011
6122433535014431
710661401326043
oct1467277445723
9346221638161
10110511410131
114295a8a0111
121950206a417
13a562448655
1454c50a9723
152d1be667c1
hex19bafe4bd3

110511410131 has 2 divisors, whose sum is σ = 110511410132. Its totient is φ = 110511410130.

The previous prime is 110511410083. The next prime is 110511410161. The reversal of 110511410131 is 131014115011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110511410131 - 227 = 110377192403 is a prime.

It is a super-4 number, since 4×1105114101314 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.

It is a junction number, because it is equal to n+sod(n) for n = 110511410099 and 110511410108.

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

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

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

Almost surely, 2110511410131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 19.

Adding to 110511410131 its reverse (131014115011), we get a palindrome (241525525142).

The spelling of 110511410131 in words is "one hundred ten billion, five hundred eleven million, four hundred ten thousand, one hundred thirty-one".