Base | Representation |
---|---|
bin | 101001011000101111100… |
… | …0010101001110101010101 |
3 | 202010210001122102120222100 |
4 | 1102301133002221311111 |
5 | 1221143243043343221 |
6 | 20033031424552313 |
7 | 1124645123500566 |
oct | 122613702516525 |
9 | 22123048376870 |
10 | 5688131231061 |
11 | 18a3360877404 |
12 | 77a493782699 |
13 | 3235086265b6 |
14 | 15944267016d |
15 | 9ce6482b926 |
hex | 52c5f0a9d55 |
5688131231061 has 12 divisors (see below), whose sum is σ = 8252068115980. Its totient is φ = 3775528152000.
The previous prime is 5688131231059. The next prime is 5688131231089. The reversal of 5688131231061 is 1601321318865.
5688131231061 is a `hidden beast` number, since 568 + 8 + 1 + 3 + 1 + 23 + 1 + 0 + 61 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 4598477092836 + 1089654138225 = 2144406^2 + 1043865^2 .
It is not a de Polignac number, because 5688131231061 - 21 = 5688131231059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5688131230998 and 5688131231016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5688131231011) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1379942440 + ... + 1379946561.
Almost surely, 25688131231061 is an apocalyptic number.
It is an amenable number.
5688131231061 is a deficient number, since it is larger than the sum of its proper divisors (2563936884919).
5688131231061 is a wasteful number, since it uses less digits than its factorization.
5688131231061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2759889236 (or 2759889233 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 45.
The spelling of 5688131231061 in words is "five trillion, six hundred eighty-eight billion, one hundred thirty-one million, two hundred thirty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •