Search a number
-
+
11050051000 = 2353172359479
BaseRepresentation
bin10100100101010001…
…00110010110111000
31001112002121202022011
422102220212112320
5140112303113000
65024252535304
7540554612062
oct122250462670
931462552264
1011050051000
11476051395a
122184781534
131071400021
1476b7bc732
1544a1792ba
hex292a265b8

11050051000 has 256 divisors, whose sum is σ = 29113344000. Its totient is φ = 3903539200.

The previous prime is 11050050961. The next prime is 11050051003. The reversal of 11050051000 is 15005011.

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 23068761 + ... + 23069239.

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

Almost surely, 211050051000 is an apocalyptic number.

11050051000 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 11050051000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14556672000).

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

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

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

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

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

The product of its (nonzero) digits is 25, while the sum is 13.

Adding to 11050051000 its reverse (15005011), we get a palindrome (11065056011).

The spelling of 11050051000 in words is "eleven billion, fifty million, fifty-one thousand".