Search a number
-
+
10555011131 = 76472330539
BaseRepresentation
bin10011101010010000…
…01011000000111011
31000020121010010021012
421311020023000323
5133104040324011
64503210304135
7522364054130
oct116510130073
930217103235
1010555011131
1145270350a5
122066a2804b
13cc2993822
14721b58587
1541b990a8b
hex27520b03b

10555011131 has 8 divisors (see below), whose sum is σ = 12081519360. Its totient is φ = 9033165288.

The previous prime is 10555011113. The next prime is 10555011133. The reversal of 10555011131 is 13111055501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10555011131 - 26 = 10555011067 is a prime.

It is a super-2 number, since 2×105550111312 (a number of 21 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 = 10555011097 and 10555011106.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1160741 + ... + 1169798.

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

Almost surely, 210555011131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2331193.

The product of its (nonzero) digits is 375, while the sum is 23.

Adding to 10555011131 its reverse (13111055501), we get a palindrome (23666066632).

The spelling of 10555011131 in words is "ten billion, five hundred fifty-five million, eleven thousand, one hundred thirty-one".

Divisors: 1 7 647 4529 2330539 16313773 1507858733 10555011131