Search a number
-
+
33642640513 is a prime number
BaseRepresentation
bin11111010101010000…
…011111010010000001
310012211121120012202201
4133111100133102001
51022400003444023
623242154313201
72300460504016
oct372520372201
9105747505681
1033642640513
11132a4436839
12662aa28801
133231c548a1
1418b213770d
15d1d80ebad
hex7d541f481

33642640513 has 2 divisors, whose sum is σ = 33642640514. Its totient is φ = 33642640512.

The previous prime is 33642640481. The next prime is 33642640519. The reversal of 33642640513 is 31504624633.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 17448296464 + 16194344049 = 132092^2 + 127257^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 33642640513 - 25 = 33642640481 is a prime.

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

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

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

Almost surely, 233642640513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 155520, while the sum is 37.

The spelling of 33642640513 in words is "thirty-three billion, six hundred forty-two million, six hundred forty thousand, five hundred thirteen".