Search a number
-
+
133270271969 is a prime number
BaseRepresentation
bin111110000011110000…
…1101111011111100001
3110201222211112021101212
41330013201233133201
54140414142200334
6141120140235505
712425363422652
oct1740741573741
9421884467355
10133270271969
115157965993a
12219b3b3bb95
13c74b5788c3
146643947529
1536eeee2ece
hex1f0786f7e1

133270271969 has 2 divisors, whose sum is σ = 133270271970. Its totient is φ = 133270271968.

The previous prime is 133270271963. The next prime is 133270272007. The reversal of 133270271969 is 969172072331.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 80122963600 + 53147308369 = 283060^2 + 230537^2 .

It is a cyclic number.

It is not a de Polignac number, because 133270271969 - 212 = 133270267873 is a prime.

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

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

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

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

Almost surely, 2133270271969 is an apocalyptic number.

It is an amenable number.

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

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

133270271969 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 857304, while the sum is 50.

The spelling of 133270271969 in words is "one hundred thirty-three billion, two hundred seventy million, two hundred seventy-one thousand, nine hundred sixty-nine".