Base | Representation |
---|---|
bin | 10100110111010010… |
… | …10110100001000000 |
3 | 1001220122010010000021 |
4 | 22123221112201000 |
5 | 140420004240300 |
6 | 5051253303224 |
7 | 544401665500 |
oct | 123351264100 |
9 | 31818103007 |
10 | 11201243200 |
11 | 482889a894 |
12 | 2207334b14 |
13 | 1096828774 |
14 | 7838d7a00 |
15 | 458591d1a |
hex | 29ba56840 |
11201243200 has 126 divisors (see below), whose sum is σ = 32062211466. Its totient is φ = 3840399360.
The previous prime is 11201243167. The next prime is 11201243227. The reversal of 11201243200 is 234210211.
It can be written as a sum of positive squares in 3 ways, for example, as 2255110144 + 8946133056 = 47488^2 + 94584^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 6964 + ... + 149836.
Almost surely, 211201243200 is an apocalyptic number.
11201243200 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 11201243200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16031105733).
11201243200 is an abundant number, since it is smaller than the sum of its proper divisors (20860968266).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201243200 is a wasteful number, since it uses less digits than its factorization.
11201243200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142909 (or 142887 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 11201243200 its reverse (234210211), we get a palindrome (11435453411).
The spelling of 11201243200 in words is "eleven billion, two hundred one million, two hundred forty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •