Search a number
-
+
110130310331513 is a prime number
BaseRepresentation
bin11001000010100110110110…
…000001101011110001111001
3112102221100120200102111112122
4121002212312001223301321
5103413333333421102023
61030121055514251025
732124436520203523
oct3102466601536171
9472840520374478
10110130310331513
11321000030aaa4a
1210427baa126a75
13495b3225504b4
141d2a49a70ca13
15caeb1e9262c8
hex6429b606bc79

110130310331513 has 2 divisors, whose sum is σ = 110130310331514. Its totient is φ = 110130310331512.

The previous prime is 110130310331491. The next prime is 110130310331537. The reversal of 110130310331513 is 315133013031011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 82578603274729 + 27551707056784 = 9087277^2 + 5248972^2 .

It is a cyclic number.

It is not a de Polignac number, because 110130310331513 - 230 = 110129236589689 is a prime.

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

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

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

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

Almost surely, 2110130310331513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 110130310331513 its reverse (315133013031011), we get a palindrome (425263323362524).

The spelling of 110130310331513 in words is "one hundred ten trillion, one hundred thirty billion, three hundred ten million, three hundred thirty-one thousand, five hundred thirteen".