Base | Representation |
---|---|
bin | 1010001000111010100110… |
… | …1011001100111010000000 |
3 | 1110110202200021110000010120 |
4 | 2202032221223030322000 |
5 | 2430123142410321210 |
6 | 35413241404300240 |
7 | 2230302640225641 |
oct | 242165153147200 |
9 | 43422607400116 |
10 | 11148286807680 |
11 | 3608a642a4340 |
12 | 1300742841680 |
13 | 62b381a88339 |
14 | 2a78195a96c8 |
15 | 144ed4b7b270 |
hex | a23a9acce80 |
11148286807680 has 128 divisors (see below), whose sum is σ = 38765633745600. Its totient is φ = 2702614978560.
The previous prime is 11148286807613. The next prime is 11148286807687. The reversal of 11148286807680 is 8670868284111.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (60).
It is not an unprimeable number, because it can be changed into a prime (11148286807687) by changing a digit.
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, 263906125 + ... + 263948364.
Almost surely, 211148286807680 is an apocalyptic number.
11148286807680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11148286807680 is an abundant number, since it is smaller than the sum of its proper divisors (27617346937920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11148286807680 is a wasteful number, since it uses less digits than its factorization.
11148286807680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527854522 (or 527854510 counting only the distinct ones).
The product of its (nonzero) digits is 8257536, while the sum is 60.
The spelling of 11148286807680 in words is "eleven trillion, one hundred forty-eight billion, two hundred eighty-six million, eight hundred seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •