Base | Representation |
---|---|
bin | 10100101000101000… |
… | …11000110100000000 |
3 | 1001121001210022100100 |
4 | 22110110120310000 |
5 | 140142021311242 |
6 | 5031142322400 |
7 | 541350025230 |
oct | 122424306400 |
9 | 31531708310 |
10 | 11078307072 |
11 | 4775463088 |
12 | 2192129400 |
13 | 10772142b1 |
14 | 771455cc0 |
15 | 44c8ab54c |
hex | 294518d00 |
11078307072 has 216 divisors, whose sum is σ = 36754390400. Its totient is φ = 3143577600.
The previous prime is 11078307043. The next prime is 11078307073. The reversal of 11078307072 is 27070387011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11078307073) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 2433054 + ... + 2437602.
Almost surely, 211078307072 is an apocalyptic number.
11078307072 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 11078307072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18377195200).
11078307072 is an abundant number, since it is smaller than the sum of its proper divisors (25676083328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11078307072 is a wasteful number, since it uses less digits than its factorization.
11078307072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4729 (or 4712 counting only the distinct ones).
The product of its (nonzero) digits is 16464, while the sum is 36.
The spelling of 11078307072 in words is "eleven billion, seventy-eight million, three hundred seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •