Base | Representation |
---|---|
bin | 1010001000010110101010… |
… | …0000011101100100000000 |
3 | 1110102211202202210201022000 |
4 | 2202011222200131210000 |
5 | 2424443412043434440 |
6 | 35405004053344000 |
7 | 2226511545060225 |
oct | 242055240354400 |
9 | 43384682721260 |
10 | 11138637093120 |
11 | 3604962289a29 |
12 | 12ba8ab038000 |
13 | 62a4a4823c74 |
14 | 2a7181b8994c |
15 | 144b1c911730 |
hex | a216a81d900 |
11138637093120 has 288 divisors, whose sum is σ = 40594984967040. Its totient is φ = 2890024427520.
The previous prime is 11138637093071. The next prime is 11138637093121. The reversal of 11138637093120 is 2139073683111.
11138637093120 is a `hidden beast` number, since 1 + 1 + 1 + 3 + 8 + 637 + 0 + 9 + 3 + 1 + 2 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (11138637093121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3076666 + ... + 5634105.
Almost surely, 211138637093120 is an apocalyptic number.
11138637093120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11138637093120 is an abundant number, since it is smaller than the sum of its proper divisors (29456347873920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11138637093120 is an equidigital number, since it uses as much as digits as its factorization.
11138637093120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8710838 (or 8710818 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 45.
The spelling of 11138637093120 in words is "eleven trillion, one hundred thirty-eight billion, six hundred thirty-seven million, ninety-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •