Base | Representation |
---|---|
bin | 1001100110110001010000… |
… | …0001101010011010101001 |
3 | 1101101200111021200000100210 |
4 | 2121230110001222122221 |
5 | 2341020240100423230 |
6 | 34243543200051333 |
7 | 2140024536343365 |
oct | 231542401523251 |
9 | 41350437600323 |
10 | 10561660561065 |
11 | 34021a2054699 |
12 | 1226b06903b49 |
13 | 5b7c63a81693 |
14 | 2872895822a5 |
15 | 134aede8beb0 |
hex | 99b1406a6a9 |
10561660561065 has 64 divisors (see below), whose sum is σ = 17837212953600. Its totient is φ = 5321688908544.
The previous prime is 10561660561057. The next prime is 10561660561079. The reversal of 10561660561065 is 56016506616501.
It is not a de Polignac number, because 10561660561065 - 23 = 10561660561057 is a prime.
It is a super-2 number, since 2×105616605610652 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
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 63 ways as a sum of consecutive naturals, for example, 186090022 + ... + 186146768.
It is an arithmetic number, because the mean of its divisors is an integer number (278706452400).
Almost surely, 210561660561065 is an apocalyptic number.
10561660561065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10561660561065 is a deficient number, since it is larger than the sum of its proper divisors (7275552392535).
10561660561065 is a wasteful number, since it uses less digits than its factorization.
10561660561065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58566.
The product of its (nonzero) digits is 972000, while the sum is 48.
The spelling of 10561660561065 in words is "ten trillion, five hundred sixty-one billion, six hundred sixty million, five hundred sixty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •