Base | Representation |
---|---|
bin | 10100111100011100… |
… | …01000100111000000 |
3 | 1002000122101201212202 |
4 | 22132032020213000 |
5 | 141012034040000 |
6 | 5055435212332 |
7 | 545435106623 |
oct | 123616104700 |
9 | 32018351782 |
10 | 11244440000 |
11 | 4850214222 |
12 | 22198a70a8 |
13 | 10a27713c1 |
14 | 78953ddba |
15 | 45c275dd5 |
hex | 29e3889c0 |
11244440000 has 140 divisors (see below), whose sum is σ = 28149270600. Its totient is φ = 4454784000.
The previous prime is 11244439993. The next prime is 11244440003. The reversal of 11244440000 is 4444211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11244440003) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4358711 + ... + 4361289.
Almost surely, 211244440000 is an apocalyptic number.
11244440000 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 11244440000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14074635300).
11244440000 is an abundant number, since it is smaller than the sum of its proper divisors (16904830600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11244440000 is an equidigital number, since it uses as much as digits as its factorization.
11244440000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2720 (or 2695 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 11244440000 its reverse (4444211), we get a palindrome (11248884211).
The spelling of 11244440000 in words is "eleven billion, two hundred forty-four million, four hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •