Base | Representation |
---|---|
bin | 1001101001011110100110… |
… | …1111011101010011101101 |
3 | 1101120010121101220101001221 |
4 | 2122113221233131103231 |
5 | 2342301041110122330 |
6 | 34321200551303341 |
7 | 2143262660256121 |
oct | 232275157352355 |
9 | 41503541811057 |
10 | 10608195785965 |
11 | 341aa01a69948 |
12 | 1233b3337ab51 |
13 | 5bc46ba6900b |
14 | 289621a83581 |
15 | 135e24581b7a |
hex | 9a5e9bdd4ed |
10608195785965 has 32 divisors (see below), whose sum is σ = 12856966143840. Its totient is φ = 8402319212544.
The previous prime is 10608195785959. The next prime is 10608195786049. The reversal of 10608195785965 is 56958759180601.
It can be written as a sum of positive squares in 16 ways, for example, as 3552361722441 + 7055834063524 = 1884771^2 + 2656282^2 .
It is a cyclic number.
It is not a de Polignac number, because 10608195785965 - 225 = 10608162231533 is a prime.
It is a super-2 number, since 2×106081957859652 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10608195785894 and 10608195785903.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 171520027 + ... + 171581863.
It is an arithmetic number, because the mean of its divisors is an integer number (401780191995).
Almost surely, 210608195785965 is an apocalyptic number.
It is an amenable number.
10608195785965 is a deficient number, since it is larger than the sum of its proper divisors (2248770357875).
10608195785965 is a wasteful number, since it uses less digits than its factorization.
10608195785965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62881.
The product of its (nonzero) digits is 163296000, while the sum is 70.
The spelling of 10608195785965 in words is "ten trillion, six hundred eight billion, one hundred ninety-five million, seven hundred eighty-five thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •