Base | Representation |
---|---|
bin | 1010000001010000000001… |
… | …0111111111100011100100 |
3 | 1110000011202121121011011111 |
4 | 2200110000113333203210 |
5 | 2420443442413411001 |
6 | 35232542135314404 |
7 | 2214631360611031 |
oct | 240240027774344 |
9 | 43004677534144 |
10 | 11016597403876 |
11 | 356812703a119 |
12 | 129b11021ba04 |
13 | 61bb25ba72ac |
14 | 2a12c59b6388 |
15 | 141878858851 |
hex | a05005ff8e4 |
11016597403876 has 27 divisors (see below), whose sum is σ = 19366273377129. Its totient is φ = 5483488235088.
The previous prime is 11016597403843. The next prime is 11016597403891. The reversal of 11016597403876 is 67830479561011.
It is a happy number.
The square root of 11016597403876 is 3319126.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 10260323674276 + 756273729600 = 3203174^2 + 869640^2 .
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 11016597403876.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 1520156085 + ... + 1520163331.
Almost surely, 211016597403876 is an apocalyptic number.
11016597403876 is the 3319126-th square number.
It is an amenable number.
11016597403876 is a deficient number, since it is larger than the sum of its proper divisors (8349675973253).
11016597403876 is an frugal number, since it uses more digits than its factorization.
11016597403876 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14956 (or 7478 counting only the distinct ones).
The product of its (nonzero) digits is 7620480, while the sum is 58.
The spelling of 11016597403876 in words is "eleven trillion, sixteen billion, five hundred ninety-seven million, four hundred three thousand, eight hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •