Search a number
-
+
10841763248551 = 8321573778959
BaseRepresentation
bin1001110111000100101101…
…1100100111100110100111
31102101110111010021211121101
42131301023130213212213
52410112412342423201
635020345352500531
72166202000036414
oct235611334474647
942343433254541
1010841763248551
1134aaa69789564
1212712586aa747
136084b257a491
14296a5bccd10b
1513c044915d01
hex9dc4b7279a7

10841763248551 has 6 divisors (see below), whose sum is σ = 10973960688080. Its totient is φ = 10711139588148.

The previous prime is 10841763248513. The next prime is 10841763248609. The reversal of 10841763248551 is 15584236714801.

It is not a de Polignac number, because 10841763248551 - 213 = 10841763240359 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10841763248951) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 786882591 + ... + 786896368.

Almost surely, 210841763248551 is an apocalyptic number.

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

10841763248551 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 1573779125 (or 1573779042 counting only the distinct ones).

The product of its (nonzero) digits is 6451200, while the sum is 55.

The spelling of 10841763248551 in words is "ten trillion, eight hundred forty-one billion, seven hundred sixty-three million, two hundred forty-eight thousand, five hundred fifty-one".

Divisors: 1 83 6889 1573778959 130623653597 10841763248551