Base | Representation |
---|---|
bin | 10100110000000011… |
… | …10000010110100101 |
3 | 1001202101212122101021 |
4 | 22120001300112211 |
5 | 140303434002441 |
6 | 5041244131141 |
7 | 543033646012 |
oct | 123001602645 |
9 | 31671778337 |
10 | 11140531621 |
11 | 47a75a332a |
12 | 21aab36ab1 |
13 | 108708c95b |
14 | 779812709 |
15 | 45309d3d1 |
hex | 2980705a5 |
11140531621 has 8 divisors (see below), whose sum is σ = 11175133464. Its totient is φ = 11105955840.
The previous prime is 11140531607. The next prime is 11140531651. The reversal of 11140531621 is 12613504111.
It can be written as a sum of positive squares in 4 ways, for example, as 5283690721 + 5856840900 = 72689^2 + 76530^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11140531621 - 229 = 10603660709 is a prime.
It is a super-2 number, since 2×111405316212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11140531601) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1165341 + ... + 1174861.
It is an arithmetic number, because the mean of its divisors is an integer number (1396891683).
Almost surely, 211140531621 is an apocalyptic number.
It is an amenable number.
11140531621 is a deficient number, since it is larger than the sum of its proper divisors (34601843).
11140531621 is an equidigital number, since it uses as much as digits as its factorization.
11140531621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13031.
The product of its (nonzero) digits is 720, while the sum is 25.
The spelling of 11140531621 in words is "eleven billion, one hundred forty million, five hundred thirty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •