Search a number
-
+
6554114537 is a prime number
BaseRepresentation
bin1100001101010011…
…11101100111101001
3121220202201111220212
412012221331213221
5101410323131122
63002205230505
7321263024435
oct60651754751
917822644825
106554114537
112863699293
12132ab62435
13805b19ca9
1446264d9c5
152855dece2
hex186a7d9e9

6554114537 has 2 divisors, whose sum is σ = 6554114538. Its totient is φ = 6554114536.

The previous prime is 6554114503. The next prime is 6554114587. The reversal of 6554114537 is 7354114556.

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., 5909919376 + 644195161 = 76876^2 + 25381^2 .

It is a cyclic number.

It is not a de Polignac number, because 6554114537 - 230 = 5480372713 is a prime.

It is a super-2 number, since 2×65541145372 = 85912834728229448738, which contains 22 as substring.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 26554114537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 252000, while the sum is 41.

The square root of 6554114537 is about 80957.4859849292. The cubic root of 6554114537 is about 1871.4203262825.

The spelling of 6554114537 in words is "six billion, five hundred fifty-four million, one hundred fourteen thousand, five hundred thirty-seven".