Search a number
-
+
11450503260 = 22325722989503
BaseRepresentation
bin10101010101000000…
…01101000001011100
31002120000010211112100
422222200031001130
5141422312101020
65132120005100
7553516446300
oct125240150134
932500124470
1011450503260
114946568639
122276900790
13110636c421
147a8a5dd00
154703cba90
hex2aa80d05c

11450503260 has 432 divisors, whose sum is σ = 42350817600. Its totient is φ = 2493646848.

The previous prime is 11450503217. The next prime is 11450503321. The reversal of 11450503260 is 6230505411.

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

It is a congruent number.

It is an unprimeable number.

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 in 143 ways as a sum of consecutive naturals, for example, 22764169 + ... + 22764671.

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

Almost surely, 211450503260 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 11450503260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21175408800).

11450503260 is an abundant number, since it is smaller than the sum of its proper divisors (30900314340).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 27.

The spelling of 11450503260 in words is "eleven billion, four hundred fifty million, five hundred three thousand, two hundred sixty".