Search a number
-
+
46533500063 is a prime number
BaseRepresentation
bin101011010101100111…
…001101110010011111
311110002222222201200022
4223111213031302133
51230300034000223
633213250222355
73235100136641
oct532547156237
9143088881608
1046533500063
1118809a47376
129027b849bb
13450783252b
1423761b2891
1513253a3ac8
hexad59cdc9f

46533500063 has 2 divisors, whose sum is σ = 46533500064. Its totient is φ = 46533500062.

The previous prime is 46533500029. The next prime is 46533500081. The reversal of 46533500063 is 36000533564.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 46533500063 - 210 = 46533499039 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (46533500003) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23266750031 + 23266750032.

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

Almost surely, 246533500063 is an apocalyptic number.

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

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

46533500063 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 97200, while the sum is 35.

The spelling of 46533500063 in words is "forty-six billion, five hundred thirty-three million, five hundred thousand, sixty-three".