Search a number
-
+
133995106961 is a prime number
BaseRepresentation
bin111110011001010111…
…0110001001010010001
3110210212100102201002022
41330302232301022101
54143410221410321
6141320112101225
712452344421342
oct1746256611221
9423770381068
10133995106961
1151910821121
1221b76834815
13c8357a2051
1466b1d080c9
15374396ddab
hex1f32bb1291

133995106961 has 2 divisors, whose sum is σ = 133995106962. Its totient is φ = 133995106960.

The previous prime is 133995106943. The next prime is 133995106963. The reversal of 133995106961 is 169601599331.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 133558087936 + 437019025 = 365456^2 + 20905^2 .

It is an emirp because it is prime and its reverse (169601599331) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-133995106961 is a prime.

Together with 133995106963, 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 (133995106963) by changing a digit.

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

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

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

Almost surely, 2133995106961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1180980, while the sum is 53.

The spelling of 133995106961 in words is "one hundred thirty-three billion, nine hundred ninety-five million, one hundred six thousand, nine hundred sixty-one".