Search a number
-
+
10531654550 = 252210633091
BaseRepresentation
bin10011100111011110…
…00100101110010110
31000011222011111001122
421303233010232112
5133032100421200
64501013523542
7521661405134
oct116357045626
930158144048
1010531654550
114514931a3a
12205b0435b2
13cbaba6671
1471c9d8754
154198ca385
hex273bc4b96

10531654550 has 12 divisors (see below), whose sum is σ = 19588877556. Its totient is φ = 4212661800.

The previous prime is 10531654537. The next prime is 10531654577. The reversal of 10531654550 is 5545613501.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10531654550.

It is a congruent number.

It is an unprimeable number.

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 in 5 ways as a sum of consecutive naturals, for example, 105316496 + ... + 105316595.

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

Almost surely, 210531654550 is an apocalyptic number.

10531654550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

10531654550 is a wasteful number, since it uses less digits than its factorization.

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

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

The product of its (nonzero) digits is 45000, while the sum is 35.

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

Divisors: 1 2 5 10 25 50 210633091 421266182 1053165455 2106330910 5265827275 10531654550