Search a number
-
+
1130130102113 is a prime number
BaseRepresentation
bin10000011100100001000…
…000001101011101100001
311000001001201011112122122
4100130201000031131201
5122004001301231423
62223101414114025
7144435451240565
oct20344100153541
94001051145578
101130130102113
113a6315a86731
1216303a34b915
13827560c346c
143c9accdb6a5
151e5e5c288c8
hex1072100d761

1130130102113 has 2 divisors, whose sum is σ = 1130130102114. Its totient is φ = 1130130102112.

The previous prime is 1130130102077. The next prime is 1130130102133. The reversal of 1130130102113 is 3112010310311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 673036470544 + 457093631569 = 820388^2 + 676087^2 .

It is a cyclic number.

It is not a de Polignac number, because 1130130102113 - 216 = 1130130036577 is a prime.

It is a super-5 number, since 5×11301301021135 (a number of 61 digits) contains 55555 as substring.

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

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

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

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

Almost surely, 21130130102113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 17.

Adding to 1130130102113 its reverse (3112010310311), we get a palindrome (4242140412424).

The spelling of 1130130102113 in words is "one trillion, one hundred thirty billion, one hundred thirty million, one hundred two thousand, one hundred thirteen".