Base | Representation |
---|---|
bin | 11011110100000000100000… |
… | …10010011011011111010001 |
3 | 22000112220012220021102101200 |
4 | 31322000100102123133101 |
5 | 31004023411013433211 |
6 | 334024443434221413 |
7 | 15611464604432505 |
oct | 1572002022333721 |
9 | 260486186242350 |
10 | 61160607561681 |
11 | 18540082573251 |
12 | 6a39403884869 |
13 | 2818560c292a4 |
14 | 1116291248305 |
15 | 710ddb2b9b56 |
hex | 37a01049b7d1 |
61160607561681 has 48 divisors (see below), whose sum is σ = 89845297776000. Its totient is φ = 40083864145920.
The previous prime is 61160607561659. The next prime is 61160607561743. The reversal of 61160607561681 is 18616570606116.
61160607561681 is a `hidden beast` number, since 6 + 1 + 16 + 0 + 6 + 0 + 7 + 5 + 616 + 8 + 1 = 666.
It is not a de Polignac number, because 61160607561681 - 27 = 61160607561553 is a prime.
It is a super-2 number, since 2×611606075616812 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (61160607561481) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 367563555 + ... + 367729911.
It is an arithmetic number, because the mean of its divisors is an integer number (1871777037000).
Almost surely, 261160607561681 is an apocalyptic number.
It is an amenable number.
61160607561681 is a deficient number, since it is larger than the sum of its proper divisors (28684690214319).
61160607561681 is a wasteful number, since it uses less digits than its factorization.
61160607561681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168086 (or 168083 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 54.
The spelling of 61160607561681 in words is "sixty-one trillion, one hundred sixty billion, six hundred seven million, five hundred sixty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •