Search a number
-
+
130155415561351 is a prime number
BaseRepresentation
bin11101100110000000101011…
…010011110110010010000111
3122001211201212200210211012201
4131212000223103312102013
5114024431242340430401
61140452323352455331
736262263350163355
oct3546005323662207
9561751780724181
10130155415561351
1138520668a37814
1212720ba93aa547
1357817abac27cb
14241d7acca67d5
15100a993818b01
hex76602b4f6487

130155415561351 has 2 divisors, whose sum is σ = 130155415561352. Its totient is φ = 130155415561350.

The previous prime is 130155415561343. The next prime is 130155415561397. The reversal of 130155415561351 is 153165514551031.

It is an a-pointer prime, because the next prime (130155415561397) can be obtained adding 130155415561351 to its sum of digits (46).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 130155415561351 - 23 = 130155415561343 is a prime.

It is a congruent number.

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

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

Almost surely, 2130155415561351 is an apocalyptic number.

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

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

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

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

The spelling of 130155415561351 in words is "one hundred thirty trillion, one hundred fifty-five billion, four hundred fifteen million, five hundred sixty-one thousand, three hundred fifty-one".