Base | Representation |
---|---|
bin | 10100110010111110… |
… | …10000111110001000 |
3 | 1001211010000000212222 |
4 | 22121133100332020 |
5 | 140331222411431 |
6 | 5043521353212 |
7 | 543452212325 |
oct | 123137207610 |
9 | 31733000788 |
10 | 11165044616 |
11 | 480a416300 |
12 | 21b7198808 |
13 | 108c19329b |
14 | 77cb93b4c |
15 | 4552e157b |
hex | 2997d0f88 |
11165044616 has 48 divisors (see below), whose sum is σ = 23066102220. Its totient is φ = 5062780800.
The previous prime is 11165044609. The next prime is 11165044633. The reversal of 11165044616 is 61644056111.
11165044616 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10496822116 + 668222500 = 102454^2 + 25850^2 .
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 11 ways as a sum of consecutive naturals, for example, 393830 + ... + 421226.
Almost surely, 211165044616 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 11165044616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11533051110).
11165044616 is an abundant number, since it is smaller than the sum of its proper divisors (11901057604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11165044616 is a wasteful number, since it uses less digits than its factorization.
11165044616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27846 (or 27831 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 35.
The spelling of 11165044616 in words is "eleven billion, one hundred sixty-five million, forty-four thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •