Search a number
-
+
13320091531633 is a prime number
BaseRepresentation
bin1100000111010101001101…
…0100101111100101110001
31202011101111002012010001211
43001311103110233211301
53221214021413003013
644155055433000121
72543226166623025
oct301652324574561
952141432163054
1013320091531633
114276023463097
1215b1633853041
1375810512ba83
143409a5678385
15181745b4223d
hexc1d5352f971

13320091531633 has 2 divisors, whose sum is σ = 13320091531634. Its totient is φ = 13320091531632.

The previous prime is 13320091531601. The next prime is 13320091531667. The reversal of 13320091531633 is 33613519002331.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12032517939264 + 1287573592369 = 3468792^2 + 1134713^2 .

It is a cyclic number.

It is not a de Polignac number, because 13320091531633 - 25 = 13320091531601 is a prime.

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

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

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

Almost surely, 213320091531633 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 13320091531633 in words is "thirteen trillion, three hundred twenty billion, ninety-one million, five hundred thirty-one thousand, six hundred thirty-three".