Base | Representation |
---|---|
bin | 10100110000000011… |
… | …10000010110100110 |
3 | 1001202101212122101022 |
4 | 22120001300112212 |
5 | 140303434002442 |
6 | 5041244131142 |
7 | 543033646013 |
oct | 123001602646 |
9 | 31671778338 |
10 | 11140531622 |
11 | 47a75a3330 |
12 | 21aab36ab2 |
13 | 108708c95c |
14 | 77981270a |
15 | 45309d3d2 |
hex | 2980705a6 |
11140531622 has 8 divisors (see below), whose sum is σ = 18229960872. Its totient is φ = 5063878000.
The previous prime is 11140531607. The next prime is 11140531651. The reversal of 11140531622 is 22613504111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×111405316222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11140531591 and 11140531600.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 253193879 + ... + 253193922.
It is an arithmetic number, because the mean of its divisors is an integer number (2278745109).
Almost surely, 211140531622 is an apocalyptic number.
11140531622 is a deficient number, since it is larger than the sum of its proper divisors (7089429250).
11140531622 is a wasteful number, since it uses less digits than its factorization.
11140531622 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506387814.
The product of its (nonzero) digits is 1440, while the sum is 26.
The spelling of 11140531622 in words is "eleven billion, one hundred forty million, five hundred thirty-one thousand, six hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •