Base | Representation |
---|---|
bin | 10000000000110110… |
… | …00110101110111101 |
3 | 211012010211212220011 |
4 | 20000123012232331 |
5 | 120101320240221 |
6 | 3541024223221 |
7 | 423020430511 |
oct | 100033065675 |
9 | 24163755804 |
10 | 8597040061 |
11 | 3711894495 |
12 | 17bb16ab11 |
13 | a7014366c |
14 | 5b7ac0141 |
15 | 354b311e1 |
hex | 2006c6bbd |
8597040061 has 4 divisors (see below), whose sum is σ = 8597299392. Its totient is φ = 8596780732.
The previous prime is 8597040017. The next prime is 8597040157. The reversal of 8597040061 is 1600407958.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1600407958 = 2 ⋅800203979.
It is a cyclic number.
It is not a de Polignac number, because 8597040061 - 217 = 8596908989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8597039996 and 8597040023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8597043061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71131 + ... + 149176.
It is an arithmetic number, because the mean of its divisors is an integer number (2149324848).
Almost surely, 28597040061 is an apocalyptic number.
It is an amenable number.
8597040061 is a deficient number, since it is larger than the sum of its proper divisors (259331).
8597040061 is a wasteful number, since it uses less digits than its factorization.
8597040061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259330.
The product of its (nonzero) digits is 60480, while the sum is 40.
The square root of 8597040061 is about 92720.2246599953. The cubic root of 8597040061 is about 2048.5645363108.
The spelling of 8597040061 in words is "eight billion, five hundred ninety-seven million, forty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •