Search a number
-
+
133059979585601 is a prime number
BaseRepresentation
bin11110010000010001110000…
…110100010010100001000001
3122110010102001202110012200022
4132100101300310102201001
5114420023314233214401
61150554524420103225
740012160223060215
oct3620216064224101
9573112052405608
10133059979585601
1139440469678362
1212b0bab9b34b15
13593266b545333
1424c01ccd52945
15105b2de85b71b
hex790470d12841

133059979585601 has 2 divisors, whose sum is σ = 133059979585602. Its totient is φ = 133059979585600.

The previous prime is 133059979585531. The next prime is 133059979585639. The reversal of 133059979585601 is 106585979950331.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 132189080017201 + 870899568400 = 11497351^2 + 933220^2 .

It is a cyclic number.

It is not a de Polignac number, because 133059979585601 - 218 = 133059979323457 is a prime.

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

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

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

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

Almost surely, 2133059979585601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 275562000, while the sum is 71.

The spelling of 133059979585601 in words is "one hundred thirty-three trillion, fifty-nine billion, nine hundred seventy-nine million, five hundred eighty-five thousand, six hundred one".