Base | Representation |
---|---|
bin | 1010000110000111111000… |
… | …0111010000001010111000 |
3 | 1110022011211210002212212110 |
4 | 2201201332013100022320 |
5 | 2423331414144321240 |
6 | 35335225043212320 |
7 | 2223654030312102 |
oct | 241417607201270 |
9 | 43264753085773 |
10 | 11100311323320 |
11 | 359a6853a290a |
12 | 12b33939770a0 |
13 | 6269a759757b |
14 | 2a5387ab6572 |
15 | 143b27ddcc80 |
hex | a187e1d02b8 |
11100311323320 has 64 divisors (see below), whose sum is σ = 33310986757920. Its totient is φ = 2959189438464.
The previous prime is 11100311323261. The next prime is 11100311323337. The reversal of 11100311323320 is 2332311300111.
It is a happy number.
It is a super-2 number, since 2×111003113233202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13562989 + ... + 14358108.
Almost surely, 211100311323320 is an apocalyptic number.
11100311323320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11100311323320 is an abundant number, since it is smaller than the sum of its proper divisors (22210675434600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100311323320 is a wasteful number, since it uses less digits than its factorization.
11100311323320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27924424 (or 27924420 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11100311323320 its reverse (2332311300111), we get a palindrome (13432622623431).
The spelling of 11100311323320 in words is "eleven trillion, one hundred billion, three hundred eleven million, three hundred twenty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •