Search a number
-
+
6272660137 is a prime number
BaseRepresentation
bin1011101011110000…
…10011001010101001
3121012011010011001211
411311320103022221
5100321300111022
62514232513121
7311304505612
oct56570231251
917164104054
106272660137
112729831447
12127084b7a1
1378c713623
14437106c09
1526aa45e77
hex175e132a9

6272660137 has 2 divisors, whose sum is σ = 6272660138. Its totient is φ = 6272660136.

The previous prime is 6272660087. The next prime is 6272660179. The reversal of 6272660137 is 7310662726.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4869108841 + 1403551296 = 69779^2 + 37464^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-6272660137 is a prime.

It is a super-4 number, since 4×62726601374 (a number of 40 digits) contains 4444 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 6272660137.

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

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

Almost surely, 26272660137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 6272660137 is about 79200.1271274232. The cubic root of 6272660137 is about 1844.2392152250.

The spelling of 6272660137 in words is "six billion, two hundred seventy-two million, six hundred sixty thousand, one hundred thirty-seven".