Base | Representation |
---|---|
bin | 10100110001110101… |
… | …10110101111100000 |
3 | 1001210110001010010200 |
4 | 22120322312233200 |
5 | 140321302000000 |
6 | 5042541025200 |
7 | 543305120421 |
oct | 123072665740 |
9 | 31713033120 |
10 | 11155500000 |
11 | 4804a97297 |
12 | 21b3b55200 |
13 | 108a200a98 |
14 | 77b7cb648 |
15 | 454558500 |
hex | 298eb6be0 |
11155500000 has 504 divisors, whose sum is σ = 41333377176. Its totient is φ = 2851200000.
The previous prime is 11155499983. The next prime is 11155500029. The reversal of 11155500000 is 555111.
11155500000 is a `hidden beast` number, since 1 + 115 + 550 + 0 + 0 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a zygodrome in base 10.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 166499967 + ... + 166500033.
It is an arithmetic number, because the mean of its divisors is an integer number (82010669).
Almost surely, 211155500000 is an apocalyptic number.
11155500000 is a gapful number since it is divisible by the number (10) 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 11155500000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20666688588).
11155500000 is an abundant number, since it is smaller than the sum of its proper divisors (30177877176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11155500000 is an frugal number, since it uses more digits than its factorization.
11155500000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150 (or 114 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 18.
The spelling of 11155500000 in words is "eleven billion, one hundred fifty-five million, five hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •