Search a number
-
+
133119970561553 is a prime number
BaseRepresentation
bin11110010001001001101000…
…100011101100111000010001
3122110100010220122001112202112
4132101021220203230320101
5114422014144430432203
61151042245322555105
740016412653001563
oct3621115043547021
9573303818045675
10133119970561553
1139463953a51528
1212b1b660968a95
13593820c162c41
1424c3080537333
15105cb513ca6d8
hex7912688ece11

133119970561553 has 2 divisors, whose sum is σ = 133119970561554. Its totient is φ = 133119970561552.

The previous prime is 133119970561519. The next prime is 133119970561597. The reversal of 133119970561553 is 355165079911331.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 126399495019009 + 6720475542544 = 11242753^2 + 2592388^2 .

It is a cyclic number.

It is not a de Polignac number, because 133119970561553 - 216 = 133119970496017 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 133119970561492 and 133119970561501.

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

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

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

Almost surely, 2133119970561553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11481750, while the sum is 59.

The spelling of 133119970561553 in words is "one hundred thirty-three trillion, one hundred nineteen billion, nine hundred seventy million, five hundred sixty-one thousand, five hundred fifty-three".