Base | Representation |
---|---|
bin | 11100110000101000010011… |
… | …10000001101000101100000 |
3 | 22021221000200020020122100110 |
4 | 32120110021300031011200 |
5 | 31242140301102040211 |
6 | 342301404455051320 |
7 | 16215124205201424 |
oct | 1630241160150540 |
9 | 267830606218313 |
10 | 63243557065056 |
11 | 19173495230705 |
12 | 7115037370b40 |
13 | 2939ac36a9524 |
14 | 118900c492b84 |
15 | 74a19b682ea6 |
hex | 398509c0d160 |
63243557065056 has 24 divisors (see below), whose sum is σ = 166014337296024. Its totient is φ = 21081185688320.
The previous prime is 63243557065049. The next prime is 63243557065069. The reversal of 63243557065056 is 65056075534236.
It is a tau number, because it is divible by the number of its divisors (24).
It is a junction number, because it is equal to n+sod(n) for n = 63243557064987 and 63243557065005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 329393526285 + ... + 329393526476.
It is an arithmetic number, because the mean of its divisors is an integer number (6917264054001).
Almost surely, 263243557065056 is an apocalyptic number.
It is an amenable number.
63243557065056 is an abundant number, since it is smaller than the sum of its proper divisors (102770780230968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63243557065056 is a wasteful number, since it uses less digits than its factorization.
63243557065056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 658787052774 (or 658787052766 counting only the distinct ones).
The product of its (nonzero) digits is 68040000, while the sum is 57.
The spelling of 63243557065056 in words is "sixty-three trillion, two hundred forty-three billion, five hundred fifty-seven million, sixty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •