Base | Representation |
---|---|
bin | 110100101001001111011101… |
… | …1110100011111111101111000 |
3 | 2020201120120211112012101122221 |
4 | 1221102132323310133331320 |
5 | 441143324210312320211 |
6 | 4320505051450453424 |
7 | 166352226423135016 |
oct | 15122367364377570 |
9 | 2221516745171587 |
10 | 463065050120056 |
11 | 12460186a79147a |
12 | 43b29138434274 |
13 | 16b4cb01712b27 |
14 | 824c67a3178b6 |
15 | 38805b81cec71 |
hex | 1a527bbd1ff78 |
463065050120056 has 8 divisors (see below), whose sum is σ = 868246968975120. Its totient is φ = 231532525060024.
The previous prime is 463065050120053. The next prime is 463065050120081. The reversal of 463065050120056 is 650021050560364.
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 463065050119994 and 463065050120021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (463065050120053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28941565632496 + ... + 28941565632511.
It is an arithmetic number, because the mean of its divisors is an integer number (108530871121890).
Almost surely, 2463065050120056 is an apocalyptic number.
It is an amenable number.
463065050120056 is a deficient number, since it is larger than the sum of its proper divisors (405181918855064).
463065050120056 is a wasteful number, since it uses less digits than its factorization.
463065050120056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57883131265013 (or 57883131265009 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 43.
The spelling of 463065050120056 in words is "four hundred sixty-three trillion, sixty-five billion, fifty million, one hundred twenty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •