Search a number
-
+
134621503635611 is a prime number
BaseRepresentation
bin11110100111000000000010…
…111001110100000010011011
3122122122200122001102220201202
4132213000002321310002123
5120121114314412314421
61154152133123504415
740233040233356036
oct3647000271640233
9578580561386652
10134621503635611
1139992728255073
121312267122810b
135a169a407ba55
142535a0363601d
151086c3315410b
hex7a7002e7409b

134621503635611 has 2 divisors, whose sum is σ = 134621503635612. Its totient is φ = 134621503635610.

The previous prime is 134621503635547. The next prime is 134621503635613. The reversal of 134621503635611 is 116536305126431.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 134621503635611 - 26 = 134621503635547 is a prime.

It is a super-4 number, since 4×1346215036356114 (a number of 58 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.

Together with 134621503635613, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 2134621503635611 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1166400, while the sum is 47.

The spelling of 134621503635611 in words is "one hundred thirty-four trillion, six hundred twenty-one billion, five hundred three million, six hundred thirty-five thousand, six hundred eleven".