Base | Representation |
---|---|
bin | 10100111000100000… |
… | …01100000100000000 |
3 | 1001221100021100102221 |
4 | 22130100030010000 |
5 | 140430111032000 |
6 | 5052255420424 |
7 | 544554350230 |
oct | 123420140400 |
9 | 31840240387 |
10 | 11211424000 |
11 | 4833613877 |
12 | 220a824714 |
13 | 10989816ca |
14 | 784dc7cc0 |
15 | 45940361a |
hex | 29c40c100 |
11211424000 has 144 divisors (see below), whose sum is σ = 31919561856. Its totient is φ = 3843840000.
The previous prime is 11211423967. The next prime is 11211424019. The reversal of 11211424000 is 42411211.
It is a happy number.
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 15 ways as a sum of consecutive naturals, for example, 198975 + ... + 249025.
It is an arithmetic number, because the mean of its divisors is an integer number (221663624).
Almost surely, 211211424000 is an apocalyptic number.
11211424000 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 11211424000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15959780928).
11211424000 is an abundant number, since it is smaller than the sum of its proper divisors (20708137856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211424000 is an frugal number, since it uses more digits than its factorization.
11211424000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50089 (or 50065 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 11211424000 its reverse (42411211), we get a palindrome (11253835211).
The spelling of 11211424000 in words is "eleven billion, two hundred eleven million, four hundred twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •