Base | Representation |
---|---|
bin | 11110111001100101000… |
… | …01101000111111011001 |
3 | 10202111110000111221222102 |
4 | 33130302201220333121 |
5 | 114343332334222221 |
6 | 2131423530133145 |
7 | 136464013132412 |
oct | 17346241507731 |
9 | 3674400457872 |
10 | 1061704601561 |
11 | 37a2a262937a |
12 | 1519228811b5 |
13 | 7916cc238b6 |
14 | 3955b45c809 |
15 | 1c93d97b30b |
hex | f732868fd9 |
1061704601561 has 8 divisors (see below), whose sum is σ = 1066781469600. Its totient is φ = 1056634456000.
The previous prime is 1061704601497. The next prime is 1061704601599. The reversal of 1061704601561 is 1651064071601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1061704601561 - 26 = 1061704601497 is a prime.
It is a super-3 number, since 3×10617046015613 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1061704609561) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1363856 + ... + 1995873.
It is an arithmetic number, because the mean of its divisors is an integer number (133347683700).
Almost surely, 21061704601561 is an apocalyptic number.
It is an amenable number.
1061704601561 is a deficient number, since it is larger than the sum of its proper divisors (5076868039).
1061704601561 is a wasteful number, since it uses less digits than its factorization.
1061704601561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3361239.
The product of its (nonzero) digits is 30240, while the sum is 38.
The spelling of 1061704601561 in words is "one trillion, sixty-one billion, seven hundred four million, six hundred one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •