Search a number
-
+
56748527669 is a prime number
BaseRepresentation
bin110100110110011110…
…011101000000110101
312102110220100220020002
4310312132131000311
51412210110341134
642023033521045
74046165345351
oct646636350065
9172426326202
1056748527669
1122081078849
12abb8b73185
135474c39072
142a64b0a461
15172208887e
hexd3679d035

56748527669 has 2 divisors, whose sum is σ = 56748527670. Its totient is φ = 56748527668.

The previous prime is 56748527653. The next prime is 56748527783. The reversal of 56748527669 is 96672584765.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 55760682769 + 987844900 = 236137^2 + 31430^2 .

It is a cyclic number.

It is not a de Polignac number, because 56748527669 - 24 = 56748527653 is a prime.

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

It is a congruent number.

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

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

Almost surely, 256748527669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 152409600, while the sum is 65.

The spelling of 56748527669 in words is "fifty-six billion, seven hundred forty-eight million, five hundred twenty-seven thousand, six hundred sixty-nine".