Search a number
-
+
133103404030369 is a prime number
BaseRepresentation
bin11110010000111010001101…
…000111011001100110100001
3122110021120011002012120021111
4132100322031013121212201
5114421231232412432434
61151030505404423321
740015255301546053
oct3620721507314641
9573246132176244
10133103404030369
1139457922638443
1212b183b8847b41
13593679bbcbc76
1424c234c2518d3
15105c4d1cc8964
hex790e8d1d99a1

133103404030369 has 2 divisors, whose sum is σ = 133103404030370. Its totient is φ = 133103404030368.

The previous prime is 133103404030319. The next prime is 133103404030381. The reversal of 133103404030369 is 963030404301331.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 132157671120225 + 945732910144 = 11495985^2 + 972488^2 .

It is a cyclic number.

It is not a de Polignac number, because 133103404030369 - 27 = 133103404030241 is a prime.

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

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

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

Almost surely, 2133103404030369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 209952, while the sum is 40.

The spelling of 133103404030369 in words is "one hundred thirty-three trillion, one hundred three billion, four hundred four million, thirty thousand, three hundred sixty-nine".