Search a number
-
+
134503315361 is a prime number
BaseRepresentation
bin111110101000100000…
…1011011011110100001
3110212011202201100221122
41331101001123132201
54200430322042421
6141442344502025
712501055213442
oct1752101333641
9425152640848
10134503315361
1152051684668
1222098a7a915
13c8b6b6c38c
14671d5d92c9
1537733a92ab
hex1f5105b7a1

134503315361 has 2 divisors, whose sum is σ = 134503315362. Its totient is φ = 134503315360.

The previous prime is 134503315327. The next prime is 134503315391. The reversal of 134503315361 is 163513305431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130678635025 + 3824680336 = 361495^2 + 61844^2 .

It is a cyclic number.

It is not a de Polignac number, because 134503315361 - 214 = 134503298977 is a prime.

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

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

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

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

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

Almost surely, 2134503315361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48600, while the sum is 35.

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