Base | Representation |
---|---|
bin | 101100011111110000111… |
… | …001110001110010110100 |
3 | 101211022121210100022201021 |
4 | 230133300321301302310 |
5 | 400044244414103320 |
6 | 10300414522110524 |
7 | 433626141162232 |
oct | 54376071616264 |
9 | 11738553308637 |
10 | 3057763425460 |
11 | a79876813227 |
12 | 41474694b444 |
13 | 192465ac10b3 |
14 | a7dd470b952 |
15 | 54815952daa |
hex | 2c7f0e71cb4 |
3057763425460 has 12 divisors (see below), whose sum is σ = 6421303193508. Its totient is φ = 1223105370176.
The previous prime is 3057763425439. The next prime is 3057763425473. The reversal of 3057763425460 is 645243677503.
It can be written as a sum of positive squares in 2 ways, for example, as 2359037959056 + 698725466404 = 1535916^2 + 835898^2 .
It is a junction number, because it is equal to n+sod(n) for n = 3057763425398 and 3057763425407.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76444085617 + ... + 76444085656.
It is an arithmetic number, because the mean of its divisors is an integer number (535108599459).
Almost surely, 23057763425460 is an apocalyptic number.
It is an amenable number.
3057763425460 is an abundant number, since it is smaller than the sum of its proper divisors (3363539768048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3057763425460 is a wasteful number, since it uses less digits than its factorization.
3057763425460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152888171282 (or 152888171280 counting only the distinct ones).
The product of its (nonzero) digits is 12700800, while the sum is 52.
The spelling of 3057763425460 in words is "three trillion, fifty-seven billion, seven hundred sixty-three million, four hundred twenty-five thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •