Base | Representation |
---|---|
bin | 1010001001000001000000… |
… | …0111101010011011000000 |
3 | 1110110221010001112220000000 |
4 | 2202100100013222123000 |
5 | 2430140202404412030 |
6 | 35414124123000000 |
7 | 2230363350236604 |
oct | 242202007523300 |
9 | 43427101486000 |
10 | 11150005544640 |
11 | 36097664a4906 |
12 | 1300b42369000 |
13 | 62b596b95161 |
14 | 2a793d96b504 |
15 | 1450859d1860 |
hex | a24101ea6c0 |
11150005544640 has 224 divisors, whose sum is σ = 39820358377920. Its totient is φ = 2973334625280.
The previous prime is 11150005544621. The next prime is 11150005544669. The reversal of 11150005544640 is 4644550005111.
11150005544640 is a `hidden beast` number, since 1 + 1 + 1 + 5 + 0 + 0 + 0 + 5 + 5 + 4 + 4 + 640 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 11150005544595 and 11150005544604.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7266271 + ... + 8665950.
Almost surely, 211150005544640 is an apocalyptic number.
11150005544640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11150005544640 is an abundant number, since it is smaller than the sum of its proper divisors (28670352833280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11150005544640 is an frugal number, since it uses more digits than its factorization.
11150005544640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15932259 (or 15932231 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 36.
Adding to 11150005544640 its reverse (4644550005111), we get a palindrome (15794555549751).
The spelling of 11150005544640 in words is "eleven trillion, one hundred fifty billion, five million, five hundred forty-four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •