Base | Representation |
---|---|
bin | 10000110111101101111… |
… | …110110110100001100100 |
3 | 11002211110022122011001211 |
4 | 100313231332312201210 |
5 | 122443311223112301 |
6 | 2244332023401204 |
7 | 146521332610000 |
oct | 20675576664144 |
9 | 4084408564054 |
10 | 1159338879076 |
11 | 407744634124 |
12 | 1688302b3204 |
13 | 8542c589641 |
14 | 40180223700 |
15 | 20255161051 |
hex | 10dedfb6864 |
1159338879076 has 45 divisors (see below), whose sum is σ = 2367058153299. Its totient is φ = 496814297112.
The previous prime is 1159338879059. The next prime is 1159338879109. The reversal of 1159338879076 is 6709788339511.
It is a happy number.
The square root of 1159338879076 is 1076726.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×11593388790762 (a number of 25 digits) contains 22 as substring.
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 14 ways as a sum of consecutive naturals, for example, 105513655 + ... + 105524641.
Almost surely, 21159338879076 is an apocalyptic number.
1159338879076 is the 1076726-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1159338879076
1159338879076 is an abundant number, since it is smaller than the sum of its proper divisors (1207719274223).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1159338879076 is an frugal number, since it uses more digits than its factorization.
1159338879076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22006 (or 10996 counting only the distinct ones).
The product of its (nonzero) digits is 68584320, while the sum is 67.
The spelling of 1159338879076 in words is "one trillion, one hundred fifty-nine billion, three hundred thirty-eight million, eight hundred seventy-nine thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •