Base | Representation |
---|---|
bin | 1010100110000011011101… |
… | …1110110110010111100101 |
3 | 1112020121210121212202200011 |
4 | 2221200313132312113211 |
5 | 3011323402312000040 |
6 | 40435231135450221 |
7 | 2311414105316041 |
oct | 251406736662745 |
9 | 45217717782604 |
10 | 11648882140645 |
11 | 3791299312252 |
12 | 138176b086971 |
13 | 66663c359629 |
14 | 2c3b478bd021 |
15 | 153032ba93ea |
hex | a98377b65e5 |
11648882140645 has 8 divisors (see below), whose sum is σ = 14018942889504. Its totient is φ = 9292249498704.
The previous prime is 11648882140543. The next prime is 11648882140663. The reversal of 11648882140645 is 54604128884611.
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 11648882140645 - 27 = 11648882140517 is a prime.
It is a super-2 number, since 2×116488821406452 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11648882140645.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3357024819 + ... + 3357028288.
It is an arithmetic number, because the mean of its divisors is an integer number (1752367861188).
Almost surely, 211648882140645 is an apocalyptic number.
It is an amenable number.
11648882140645 is a deficient number, since it is larger than the sum of its proper divisors (2370060748859).
11648882140645 is an equidigital number, since it uses as much as digits as its factorization.
11648882140645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6714053459.
The product of its (nonzero) digits is 11796480, while the sum is 58.
The spelling of 11648882140645 in words is "eleven trillion, six hundred forty-eight billion, eight hundred eighty-two million, one hundred forty thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •