Search a number
-
+
133103333031173 is a prime number
BaseRepresentation
bin11110010000111010001000…
…111000100011110100000101
3122110021112222010121102200122
4132100322020320203310011
5114421231111223444143
61151030454350551325
740015253450221241
oct3620721070436405
9573245863542618
10133103333031173
113945789655471a
1212b18398b08545
13593678a2a06cb
1424c2342a4d421
15105c4ca951c68
hex790e88e23d05

133103333031173 has 2 divisors, whose sum is σ = 133103333031174. Its totient is φ = 133103333031172.

The previous prime is 133103333031157. The next prime is 133103333031313. The reversal of 133103333031173 is 371130333301331.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 125009438900644 + 8093894130529 = 11180762^2 + 2844977^2 .

It is a cyclic number.

It is not a de Polignac number, because 133103333031173 - 24 = 133103333031157 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2133103333031173 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 133103333031173 in words is "one hundred thirty-three trillion, one hundred three billion, three hundred thirty-three million, thirty-one thousand, one hundred seventy-three".