Base | Representation |
---|---|
bin | 1010000010110110001110… |
… | …1111001001111110000000 |
3 | 1110002210120201211000202121 |
4 | 2200231203233021332000 |
5 | 2421421140230132000 |
6 | 35253320445454024 |
7 | 2216622315001201 |
oct | 240554357117600 |
9 | 43083521730677 |
10 | 11044034224000 |
11 | 3578826447178 |
12 | 12a44a8871314 |
13 | 6215a921b7bb |
14 | 2a27698455a8 |
15 | 142432426b1a |
hex | a0b63bc9f80 |
11044034224000 has 128 divisors (see below), whose sum is σ = 29073420810720. Its totient is φ = 4157753958400.
The previous prime is 11044034223961. The next prime is 11044034224001. The reversal of 11044034224000 is 42243044011.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11044034224001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20029534 + ... + 20573533.
Almost surely, 211044034224000 is an apocalyptic number.
11044034224000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11044034224000 is an abundant number, since it is smaller than the sum of its proper divisors (18029386586720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11044034224000 is an equidigital number, since it uses as much as digits as its factorization.
11044034224000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40603113 (or 40603091 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 11044034224000 its reverse (42243044011), we get a palindrome (11086277268011).
The spelling of 11044034224000 in words is "eleven trillion, forty-four billion, thirty-four million, two hundred twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •