Search a number
-
+
133121426034127 is a prime number
BaseRepresentation
bin11110010001001010111111…
…010011111000110111001111
3122110100021200001210012210011
4132101022333103320313033
5114422030140031043002
61151043045554454051
740016464015214056
oct3621127723706717
9573307601705704
10133121426034127
1139464530589623
1212b1b9a8294327
1359383b1864a0b
1424c317b96939d
15105cbd907b8d7
hex7912bf4f8dcf

133121426034127 has 2 divisors, whose sum is σ = 133121426034128. Its totient is φ = 133121426034126.

The previous prime is 133121426034049. The next prime is 133121426034131. The reversal of 133121426034127 is 721430624121331.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-133121426034127 is a prime.

It is a super-2 number, since 2×1331214260341272 (a number of 29 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 133121426034127.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2133121426034127 is an apocalyptic number.

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

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

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

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

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