Base | Representation |
---|---|
bin | 11110111000100100001… |
… | …00100011011001011001 |
3 | 10202110001001221200212220 |
4 | 33130102010203121121 |
5 | 114341223441334221 |
6 | 2131253515454253 |
7 | 136444352033463 |
oct | 17342204433131 |
9 | 3673031850786 |
10 | 1061160105561 |
11 | 37a043240486 |
12 | 1517b0457389 |
13 | 790b418c70a |
14 | 39509003133 |
15 | 1c90ac740c6 |
hex | f712123659 |
1061160105561 has 32 divisors (see below), whose sum is σ = 1467004151808. Its totient is φ = 681774428160.
The previous prime is 1061160105541. The next prime is 1061160105563. The reversal of 1061160105561 is 1655010611601.
It is not a de Polignac number, because 1061160105561 - 25 = 1061160105529 is a prime.
It is a super-2 number, since 2×10611601055612 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1061160105563) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 4832425 + ... + 5047241.
It is an arithmetic number, because the mean of its divisors is an integer number (45843879744).
Almost surely, 21061160105561 is an apocalyptic number.
It is an amenable number.
1061160105561 is a deficient number, since it is larger than the sum of its proper divisors (405844046247).
1061160105561 is a wasteful number, since it uses less digits than its factorization.
1061160105561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215281.
The product of its (nonzero) digits is 5400, while the sum is 33.
The spelling of 1061160105561 in words is "one trillion, sixty-one billion, one hundred sixty million, one hundred five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •