Base | Representation |
---|---|
bin | 101000110100100111100… |
… | …1000110101110001101101 |
3 | 201212100211020002001012211 |
4 | 1101221033020311301231 |
5 | 1213410404040143221 |
6 | 15533241533130421 |
7 | 1116230532453445 |
oct | 121511710656155 |
9 | 21770736061184 |
10 | 5610555006061 |
11 | 1873472041365 |
12 | 767443629a11 |
13 | 3190c46b2b95 |
14 | 1557a3783125 |
15 | 9ae2402d6e1 |
hex | 51a4f235c6d |
5610555006061 has 4 divisors (see below), whose sum is σ = 5610563533692. Its totient is φ = 5610546478432.
The previous prime is 5610555006037. The next prime is 5610555006097. The reversal of 5610555006061 is 1606005550165.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3435903397161 + 2174651608900 = 1853619^2 + 1474670^2 .
It is a cyclic number.
It is not a de Polignac number, because 5610555006061 - 225 = 5610521451629 is a prime.
It is a super-2 number, since 2×56105550060612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5610555006031) 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, 3186130 + ... + 4623043.
It is an arithmetic number, because the mean of its divisors is an integer number (1402640883423).
Almost surely, 25610555006061 is an apocalyptic number.
It is an amenable number.
5610555006061 is a deficient number, since it is larger than the sum of its proper divisors (8527631).
5610555006061 is an equidigital number, since it uses as much as digits as its factorization.
5610555006061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8527630.
The product of its (nonzero) digits is 135000, while the sum is 40.
The spelling of 5610555006061 in words is "five trillion, six hundred ten billion, five hundred fifty-five million, six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •