Search a number
-
+
33368864256029 is a prime number
BaseRepresentation
bin1111001011001010010110…
…10011001111000000011101
311101011000212112010201201102
413211211023103033000131
513333203413222143104
6154545240011522445
710012551364161461
oct745451323170035
9141130775121642
1033368864256029
11a6a5723a47915
1238ab139159425
131580893b2b133
148350c12364a1
153cd002745a1e
hex1e594b4cf01d

33368864256029 has 2 divisors, whose sum is σ = 33368864256030. Its totient is φ = 33368864256028.

The previous prime is 33368864255999. The next prime is 33368864256041. The reversal of 33368864256029 is 92065246886333.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 30410041120900 + 2958823135129 = 5514530^2 + 1720123^2 .

It is a cyclic number.

It is not a de Polignac number, because 33368864256029 - 28 = 33368864255773 is a prime.

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

It is a congruent number.

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

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

Almost surely, 233368864256029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 268738560, while the sum is 65.

The spelling of 33368864256029 in words is "thirty-three trillion, three hundred sixty-eight billion, eight hundred sixty-four million, two hundred fifty-six thousand, twenty-nine".