Base | Representation |
---|---|
bin | 10100110001101011… |
… | …11100111001100100 |
3 | 1001210100121210202120 |
4 | 22120311330321210 |
5 | 140320434331000 |
6 | 5042453305540 |
7 | 543261154542 |
oct | 123065747144 |
9 | 31710553676 |
10 | 11154214500 |
11 | 48042994a0 |
12 | 21b36352b0 |
13 | 1089b70930 |
14 | 77b574d92 |
15 | 4543a26a0 |
hex | 298d7ce64 |
11154214500 has 384 divisors, whose sum is σ = 38525760000. Its totient is φ = 2472192000.
The previous prime is 11154214457. The next prime is 11154214553. The reversal of 11154214500 is 541245111.
It is a super-2 number, since 2×111542145002 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 31960326 + ... + 31960674.
It is an arithmetic number, because the mean of its divisors is an integer number (100327500).
Almost surely, 211154214500 is an apocalyptic number.
11154214500 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 11154214500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19262880000).
11154214500 is an abundant number, since it is smaller than the sum of its proper divisors (27371545500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11154214500 is a wasteful number, since it uses less digits than its factorization.
11154214500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 544 (or 532 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 24.
Adding to 11154214500 its reverse (541245111), we get a palindrome (11695459611).
The spelling of 11154214500 in words is "eleven billion, one hundred fifty-four million, two hundred fourteen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •