Search a number
-
+
134646727461601 is a prime number
BaseRepresentation
bin11110100111010111100010…
…010111000100101011100001
3122122202002201221112001002011
4132213113202113010223201
5120122022444212232401
61154211504101552521
740234622266350235
oct3647274227045341
9578662657461064
10134646727461601
11399a23a1467953
1213127530715741
135a19193a92284
142536d176045c5
15108770c7da451
hex7a75e25c4ae1

134646727461601 has 2 divisors, whose sum is σ = 134646727461602. Its totient is φ = 134646727461600.

The previous prime is 134646727461583. The next prime is 134646727461613. The reversal of 134646727461601 is 106164727646431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 122753547536400 + 11893179925201 = 11079420^2 + 3448649^2 .

It is a cyclic number.

It is not a de Polignac number, because 134646727461601 - 25 = 134646727461569 is a prime.

It is a super-3 number, since 3×1346467274616013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 2134646727461601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24385536, while the sum is 58.

The spelling of 134646727461601 in words is "one hundred thirty-four trillion, six hundred forty-six billion, seven hundred twenty-seven million, four hundred sixty-one thousand, six hundred one".