Search a number
-
+
11265254000 = 24537111317331
BaseRepresentation
bin10100111110111011…
…00010001001110000
31002002002120012022122
422133131202021300
5141032401112000
65101501253412
7546110036060
oct123735421160
932062505278
1011265254000
114860a40080
122224864268
1310a6b7b190
1478c1db3a0
1545ded8085
hex29f762270

11265254000 has 640 divisors, whose sum is σ = 38841513984. Its totient is φ = 3041280000.

The previous prime is 11265253997. The next prime is 11265254029. The reversal of 11265254000 is 45256211.

11265254000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a Harshad number since it is a multiple of its sum of digits (26).

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 34033835 + ... + 34034165.

Almost surely, 211265254000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2400, while the sum is 26.

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