Search a number
-
+
133101420101057 is a prime number
BaseRepresentation
bin11110010000111000010110…
…110111010011110111000001
3122110021101000211002111220002
4132100320112313103313001
5114421213202021213212
61151025540454125345
740015155161456432
oct3620702667236701
9573241024074802
10133101420101057
1139456aa4777a41
1212b17b44350855
135936543b906b5
1424c220097b489
15105c417a3cac2
hex790e16dd3dc1

133101420101057 has 2 divisors, whose sum is σ = 133101420101058. Its totient is φ = 133101420101056.

The previous prime is 133101420101021. The next prime is 133101420101077. The reversal of 133101420101057 is 750101024101331.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 130399864364176 + 2701555736881 = 11419276^2 + 1643641^2 .

It is a cyclic number.

It is not a de Polignac number, because 133101420101057 - 242 = 128703373589953 is a prime.

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

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

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

Almost surely, 2133101420101057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 29.

Adding to 133101420101057 its reverse (750101024101331), we get a palindrome (883202444202388).

The spelling of 133101420101057 in words is "one hundred thirty-three trillion, one hundred one billion, four hundred twenty million, one hundred one thousand, fifty-seven".