Base | Representation |
---|---|
bin | 11100001001001000011… |
… | …11000001100101111000 |
3 | 10102102221012010001110201 |
4 | 32010210033001211320 |
5 | 111320331220410211 |
6 | 2020120014051544 |
7 | 126601361434012 |
oct | 16044417014570 |
9 | 3372835101421 |
10 | 966975560056 |
11 | 343101549420 |
12 | 1374a61a9bb4 |
13 | 70254442c0c |
14 | 34b324731b2 |
15 | 1a24736c0c1 |
hex | e1243c1978 |
966975560056 has 32 divisors (see below), whose sum is σ = 1991003287680. Its totient is φ = 436623516000.
The previous prime is 966975560009. The next prime is 966975560059. The reversal of 966975560056 is 650065579669.
It is a super-2 number, since 2×9669755600562 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 966975560056.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (966975560059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36372006 + ... + 36398581.
It is an arithmetic number, because the mean of its divisors is an integer number (62218852740).
Almost surely, 2966975560056 is an apocalyptic number.
It is an amenable number.
966975560056 is an abundant number, since it is smaller than the sum of its proper divisors (1024027727624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
966975560056 is a wasteful number, since it uses less digits than its factorization.
966975560056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72770755 (or 72770751 counting only the distinct ones).
The product of its (nonzero) digits is 91854000, while the sum is 64.
The spelling of 966975560056 in words is "nine hundred sixty-six billion, nine hundred seventy-five million, five hundred sixty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •