Search a number
-
+
33047227141 is a prime number
BaseRepresentation
bin11110110001110001…
…001010101100000101
310011022010012002011121
4132301301022230011
51020140042232031
623103124433541
72246640536665
oct366161125405
9104263162147
1033047227141
1113019330975
1264a35488b1
1331687a3896
1418570261a5
15cd63eb011
hex7b1c4ab05

33047227141 has 2 divisors, whose sum is σ = 33047227142. Its totient is φ = 33047227140.

The previous prime is 33047227049. The next prime is 33047227177. The reversal of 33047227141 is 14172274033.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 32642010241 + 405216900 = 180671^2 + 20130^2 .

It is an emirp because it is prime and its reverse (14172274033) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 33047227141 - 225 = 33013672709 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 233047227141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28224, while the sum is 34.

The spelling of 33047227141 in words is "thirty-three billion, forty-seven million, two hundred twenty-seven thousand, one hundred forty-one".