Base | Representation |
---|---|
bin | 111001011000000101… |
… | …100000111001111101 |
3 | 12220000112011022020002 |
4 | 321120011200321331 |
5 | 2002132442221103 |
6 | 44145124004045 |
7 | 4310455053335 |
oct | 713005407175 |
9 | 186015138202 |
10 | 61607382653 |
11 | 24144841483 |
12 | bb34230625 |
13 | 5a6a77939b |
14 | 2da614a0c5 |
15 | 190890e488 |
hex | e58160e7d |
61607382653 has 4 divisors (see below), whose sum is σ = 61750323648. Its totient is φ = 61464441660.
The previous prime is 61607382631. The next prime is 61607382667. The reversal of 61607382653 is 35628370616.
61607382653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is a cyclic number.
It is not a de Polignac number, because 61607382653 - 220 = 61606334077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61607382598 and 61607382607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61607382253) 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, 71469851 + ... + 71470712.
It is an arithmetic number, because the mean of its divisors is an integer number (15437580912).
Almost surely, 261607382653 is an apocalyptic number.
It is an amenable number.
61607382653 is a deficient number, since it is larger than the sum of its proper divisors (142940995).
61607382653 is a wasteful number, since it uses less digits than its factorization.
61607382653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142940994.
The product of its (nonzero) digits is 1088640, while the sum is 47.
The spelling of 61607382653 in words is "sixty-one billion, six hundred seven million, three hundred eighty-two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •