Search a number
-
+
133020525205313 is a prime number
BaseRepresentation
bin11110001111101101000001…
…001001110001011101000001
3122102222122020010002000201022
4132033231001021301131001
5114413402013423032223
61150524441411515225
740006262422265354
oct3617550111613501
9572878203060638
10133020525205313
11394257627054a9
1212b043288b8b15
13592ba2152b595
1424bc32901429b
15105a280beeac8
hex78fb41271741

133020525205313 has 2 divisors, whose sum is σ = 133020525205314. Its totient is φ = 133020525205312.

The previous prime is 133020525205307. The next prime is 133020525205367. The reversal of 133020525205313 is 313502525020331.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 127394743677184 + 5625781528129 = 11286928^2 + 2371873^2 .

It is a cyclic number.

It is not a de Polignac number, because 133020525205313 - 218 = 133020524943169 is a prime.

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

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

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

Almost surely, 2133020525205313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 133020525205313 in words is "one hundred thirty-three trillion, twenty billion, five hundred twenty-five million, two hundred five thousand, three hundred thirteen".