Base | Representation |
---|---|
bin | 10100110001011111… |
… | …10101101011101000 |
3 | 1001210020121101122101 |
4 | 22120233311223220 |
5 | 140320032041242 |
6 | 5042355103144 |
7 | 543241432000 |
oct | 123057655350 |
9 | 31706541571 |
10 | 11152612072 |
11 | 48033a4578 |
12 | 21b2ba1ab4 |
13 | 108972c454 |
14 | 77b279000 |
15 | 4541879b7 |
hex | 298bf5ae8 |
11152612072 has 64 divisors (see below), whose sum is σ = 24660720000. Its totient is φ = 4725883008.
The previous prime is 11152612019. The next prime is 11152612103. The reversal of 11152612072 is 27021625111.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 11152612072.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 221383 + ... + 267049.
It is an arithmetic number, because the mean of its divisors is an integer number (385323750).
Almost surely, 211152612072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11152612072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12330360000).
11152612072 is an abundant number, since it is smaller than the sum of its proper divisors (13508107928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11152612072 is an equidigital number, since it uses as much as digits as its factorization.
11152612072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45783 (or 45765 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 28.
The spelling of 11152612072 in words is "eleven billion, one hundred fifty-two million, six hundred twelve thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •