Search a number
-
+
11060458752 = 283721931499
BaseRepresentation
bin10100100110100000…
…10011010100000000
31001112211012112001110
422103100103110000
5140122434140002
65025304003320
7541042230300
oct122320232400
931484175043
1011060458752
114766382402
122188160540
131073605365
1476cd2b600
1544b032e6c
hex293413500

11060458752 has 432 divisors, whose sum is σ = 37282560000. Its totient is φ = 2891427840.

The previous prime is 11060458727. The next prime is 11060458763. The reversal of 11060458752 is 25785406011.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22164999 + ... + 22165497.

Almost surely, 211060458752 is an apocalyptic number.

11060458752 is a gapful number since it is divisible by the number (12) 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 11060458752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18641280000).

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

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

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

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

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

The product of its (nonzero) digits is 67200, while the sum is 39.

The spelling of 11060458752 in words is "eleven billion, sixty million, four hundred fifty-eight thousand, seven hundred fifty-two".