Search a number
-
+
6533097100051 is a prime number
BaseRepresentation
bin101111100010001101011…
…1011101001001100010011
3212010120001202210011002011
41133010122323221030103
51324014240324200201
621521132520003351
71243000144045564
oct137043273511423
925116052704064
106533097100051
112099741aa4aa5
128961a9000557
133850b73c3a32
141882bc8dc16b
15b4e1a569151
hex5f11aee9313

6533097100051 has 2 divisors, whose sum is σ = 6533097100052. Its totient is φ = 6533097100050.

The previous prime is 6533097100037. The next prime is 6533097100091. The reversal of 6533097100051 is 1500017903356.

It is a happy number.

It is an a-pointer prime, because the next prime (6533097100091) can be obtained adding 6533097100051 to its sum of digits (40).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 6533097100051 - 29 = 6533097099539 is a prime.

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

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

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

Almost surely, 26533097100051 is an apocalyptic number.

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

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

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

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

The spelling of 6533097100051 in words is "six trillion, five hundred thirty-three billion, ninety-seven million, one hundred thousand, fifty-one".