Search a number
-
+
55615739 is a prime number
BaseRepresentation
bin1101010000101…
…0000011111011
310212122120110012
43110022003323
5103214200424
65304012135
71243504004
oct324120373
9125576405
1055615739
1129436a23
121676104b
13b6a352a
14755a1ab
154d38b0e
hex350a0fb

55615739 has 2 divisors, whose sum is σ = 55615740. Its totient is φ = 55615738.

The previous prime is 55615733. The next prime is 55615753. The reversal of 55615739 is 93751655.

55615739 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 55615739 - 24 = 55615723 is a prime.

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

It is a Chen prime.

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

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

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

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

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

Almost surely, 255615739 is an apocalyptic number.

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

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

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

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

The square root of 55615739 is about 7457.5960603937. The cubic root of 55615739 is about 381.7091501519.

The spelling of 55615739 in words is "fifty-five million, six hundred fifteen thousand, seven hundred thirty-nine".