Base | Representation |
---|---|
bin | 10100101000010101… |
… | …11110101010100000 |
3 | 1001120220011000002012 |
4 | 22110022332222200 |
5 | 140140403400142 |
6 | 5031013412052 |
7 | 541320043451 |
oct | 122412765240 |
9 | 31526130065 |
10 | 11075840672 |
11 | 4774029036 |
12 | 219133a028 |
13 | 107685c7a0 |
14 | 770db3128 |
15 | 44c570882 |
hex | 2942beaa0 |
11075840672 has 96 divisors (see below), whose sum is σ = 23851149840. Its totient is φ = 5032304640.
The previous prime is 11075840669. The next prime is 11075840707. The reversal of 11075840672 is 27604857011.
It can be written as a sum of positive squares in 8 ways, for example, as 5047249936 + 6028590736 = 71044^2 + 77644^2 .
It is a super-3 number, since 3×110758406723 (a number of 31 digits) contains 333 as substring.
It is a hoax number, since the sum of its digits (41) coincides with the sum of the digits of its distinct prime factors.
It is a zygodrome in base 4.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10847522 + ... + 10848542.
Almost surely, 211075840672 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 11075840672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11925574920).
11075840672 is an abundant number, since it is smaller than the sum of its proper divisors (12775309168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11075840672 is a wasteful number, since it uses less digits than its factorization.
11075840672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1426 (or 1418 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 41.
The spelling of 11075840672 in words is "eleven billion, seventy-five million, eight hundred forty thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •