Search a number
-
+
133113001369 is a prime number
BaseRepresentation
bin111101111111000100…
…1110011010110011001
3110201120212121002200211
41323332021303112121
54140103412020434
6141052401331121
712421443562045
oct1737611632631
9421525532624
10133113001369
11514a8901137
122196b336aa1
13c724b0258a
14662aac9025
1536e12c9464
hex1efe273599

133113001369 has 2 divisors, whose sum is σ = 133113001370. Its totient is φ = 133113001368.

The previous prime is 133113001327. The next prime is 133113001387. The reversal of 133113001369 is 963100311331.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 126711081225 + 6401920144 = 355965^2 + 80012^2 .

It is a cyclic number.

It is not a de Polignac number, because 133113001369 - 223 = 133104612761 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 133113001369.

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

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

Almost surely, 2133113001369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4374, while the sum is 31.

The spelling of 133113001369 in words is "one hundred thirty-three billion, one hundred thirteen million, one thousand, three hundred sixty-nine".