Search a number
-
+
32220321433 is a prime number
BaseRepresentation
bin11110000000011110…
…110001011010011001
310002011111012220210021
4132000132301122121
51011441400241213
622445105150441
72220310133116
oct360036613231
9102144186707
1032220321433
1112734593423
1262b262b421
133066390271
1417b929590d
15c88a0bd8d
hex7807b1699

32220321433 has 2 divisors, whose sum is σ = 32220321434. Its totient is φ = 32220321432.

The previous prime is 32220321421. The next prime is 32220321439. The reversal of 32220321433 is 33412302223.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 20087959824 + 12132361609 = 141732^2 + 110147^2 .

It is a cyclic number.

It is not a de Polignac number, because 32220321433 - 213 = 32220313241 is a prime.

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

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

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

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

Almost surely, 232220321433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5184, while the sum is 25.

Adding to 32220321433 its reverse (33412302223), we get a palindrome (65632623656).

The spelling of 32220321433 in words is "thirty-two billion, two hundred twenty million, three hundred twenty-one thousand, four hundred thirty-three".