Base | Representation |
---|---|
bin | 1010100000110101001001… |
… | …1100010111110110111100 |
3 | 1111221001011100111221200111 |
4 | 2220031102130113312330 |
5 | 3003341104340204004 |
6 | 40330110133435404 |
7 | 2302056161146210 |
oct | 250152234276674 |
9 | 44831140457614 |
10 | 11559140163004 |
11 | 3757227304185 |
12 | 13682a479bb64 |
13 | 65b039b28405 |
14 | 2bd672d88940 |
15 | 150a2e2e8a04 |
hex | a8352717dbc |
11559140163004 has 12 divisors (see below), whose sum is σ = 23118280326064. Its totient is φ = 4953917212704.
The previous prime is 11559140162993. The next prime is 11559140163029. The reversal of 11559140163004 is 40036104195511.
11559140163004 is an admirable number.
It is a super-3 number, since 3×115591401630043 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 206413217169 + ... + 206413217224.
Almost surely, 211559140163004 is an apocalyptic number.
11559140163004 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11559140163004 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11559140163004 is a wasteful number, since it uses less digits than its factorization.
11559140163004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412826434404 (or 412826434402 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 40.
The spelling of 11559140163004 in words is "eleven trillion, five hundred fifty-nine billion, one hundred forty million, one hundred sixty-three thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •