Base | Representation |
---|---|
bin | 101100100010110010100… |
… | …100101100111110110001 |
3 | 101211122000020101120212011 |
4 | 230202302210230332301 |
5 | 400122423221240000 |
6 | 10302113153002521 |
7 | 434102514325324 |
oct | 54426244547661 |
9 | 11748006346764 |
10 | 3061012680625 |
11 | a80193948779 |
12 | 4152b2b53441 |
13 | 192863016ca3 |
14 | a82220787bb |
15 | 54955d302ba |
hex | 2c8b292cfb1 |
3061012680625 has 45 divisors (see below), whose sum is σ = 3910783326087. Its totient is φ = 2395098192000.
The previous prime is 3061012680611. The next prime is 3061012680637. The reversal of 3061012680625 is 5260862101603.
The square root of 3061012680625 is 1749575.
It is a perfect power (a square), and thus also a powerful number.
3061012680625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 7 ways, for example, as 2943424040881 + 117588639744 = 1715641^2 + 342912^2 .
It is not a de Polignac number, because 3061012680625 - 221 = 3061010583473 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 2055749881 + ... + 2055751369.
Almost surely, 23061012680625 is an apocalyptic number.
3061012680625 is the 1749575-th square number.
3061012680625 is the 874788-th centered octagonal number.
It is an amenable number.
3061012680625 is a deficient number, since it is larger than the sum of its proper divisors (849770645462).
3061012680625 is an frugal number, since it uses more digits than its factorization.
3061012680625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3092 (or 1541 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 40.
The spelling of 3061012680625 in words is "three trillion, sixty-one billion, twelve million, six hundred eighty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •