Search a number
-
+
130455993061 is a prime number
BaseRepresentation
bin111100101111111001…
…0000111101011100101
3110110201200222002111201
41321133302013223211
54114133213234221
6135533004402501
712265551434122
oct1713762075345
9413650862451
10130455993061
11503650094a9
1221349546431
13c3c04bc304
146457c87749
1535d7dd7891
hex1e5fc87ae5

130455993061 has 2 divisors, whose sum is σ = 130455993062. Its totient is φ = 130455993060.

The previous prime is 130455993011. The next prime is 130455993079. The reversal of 130455993061 is 160399554031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 110277790561 + 20178202500 = 332081^2 + 142050^2 .

It is a cyclic number.

It is not a de Polignac number, because 130455993061 - 215 = 130455960293 is a prime.

It is a super-2 number, since 2×1304559930612 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (130455993001) 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, 65227996530 + 65227996531.

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

Almost surely, 2130455993061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 437400, while the sum is 46.

The spelling of 130455993061 in words is "one hundred thirty billion, four hundred fifty-five million, nine hundred ninety-three thousand, sixty-one".