Search a number
-
+
6052010101 is a prime number
BaseRepresentation
bin1011010001011101…
…00101100001110101
3120121202220222010021
411220232211201311
544343303310401
62440311325141
7302655144214
oct55056454165
916552828107
106052010101
112626224845
12120a9807b1
13755aa9087
14415aab07b
152564ad2a1
hex168ba5875

6052010101 has 2 divisors, whose sum is σ = 6052010102. Its totient is φ = 6052010100.

The previous prime is 6052010071. The next prime is 6052010221. The reversal of 6052010101 is 1010102506.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4399668900 + 1652341201 = 66330^2 + 40649^2 .

It is a cyclic number.

It is not a de Polignac number, because 6052010101 - 27 = 6052009973 is a prime.

6052010101 is a modest number, since divided by 10101 gives 6052 as remainder.

It is a congruent number.

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

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

Almost surely, 26052010101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 16.

The square root of 6052010101 is about 77794.6662760372. Note that the first 3 decimals coincide. The cubic root of 6052010101 is about 1822.3559736728.

Adding to 6052010101 its reverse (1010102506), we get a palindrome (7062112607).

The spelling of 6052010101 in words is "six billion, fifty-two million, ten thousand, one hundred one".