Base | Representation |
---|---|
bin | 101100011110101001011… |
… | …001110101011100110100 |
3 | 101211012112012011120021110 |
4 | 230132221121311130310 |
5 | 400034320322310432 |
6 | 10300055511315020 |
7 | 433554334133430 |
oct | 54365131653464 |
9 | 11735465146243 |
10 | 3056563869492 |
11 | a79310690061 |
12 | 41447107ba70 |
13 | 192304423a73 |
14 | a7d1d2959c0 |
15 | 547954a3dcc |
hex | 2c7a9675734 |
3056563869492 has 192 divisors, whose sum is σ = 8664806062080. Its totient is φ = 818651750400.
The previous prime is 3056563869473. The next prime is 3056563869517. The reversal of 3056563869492 is 2949683656503.
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 63 ways as a sum of consecutive naturals, for example, 610211884 + ... + 610216892.
It is an arithmetic number, because the mean of its divisors is an integer number (45129198240).
Almost surely, 23056563869492 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3056563869492, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4332403031040).
3056563869492 is an abundant number, since it is smaller than the sum of its proper divisors (5608242192588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3056563869492 is a wasteful number, since it uses less digits than its factorization.
3056563869492 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6662 (or 6660 counting only the distinct ones).
The product of its (nonzero) digits is 251942400, while the sum is 66.
The spelling of 3056563869492 in words is "three trillion, fifty-six billion, five hundred sixty-three million, eight hundred sixty-nine thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •