Base | Representation |
---|---|
bin | 10100110010110000… |
… | …11100001100000110 |
3 | 1001210222122010202120 |
4 | 22121120130030012 |
5 | 140330243134213 |
6 | 5043415150410 |
7 | 543431051400 |
oct | 123130341406 |
9 | 31728563676 |
10 | 11163255558 |
11 | 4809404144 |
12 | 21b6675406 |
13 | 108b9b7b80 |
14 | 77c849b70 |
15 | 45508b423 |
hex | 29961c306 |
11163255558 has 96 divisors (see below), whose sum is σ = 28872023040. Its totient is φ = 2849152320.
The previous prime is 11163255541. The next prime is 11163255559. The reversal of 11163255558 is 85555236111.
It is a super-3 number, since 3×111632555583 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11163255559) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 71373 + ... + 165591.
It is an arithmetic number, because the mean of its divisors is an integer number (300750240).
Almost surely, 211163255558 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11163255558, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14436011520).
11163255558 is an abundant number, since it is smaller than the sum of its proper divisors (17708767482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11163255558 is a wasteful number, since it uses less digits than its factorization.
11163255558 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94282 (or 94275 counting only the distinct ones).
The product of its digits is 180000, while the sum is 42.
The spelling of 11163255558 in words is "eleven billion, one hundred sixty-three million, two hundred fifty-five thousand, five hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •