Base | Representation |
---|---|
bin | 110100011110111001011010… |
… | …1000100001111010010001000 |
3 | 2020112112200001111110122222021 |
4 | 1220331302311010033102020 |
5 | 441002030440433134121 |
6 | 4313500001103534224 |
7 | 166144425251645305 |
oct | 15075626504172210 |
9 | 2215480044418867 |
10 | 461643302630536 |
11 | 124103909356454 |
12 | 43939693bba374 |
13 | 16a78a13398280 |
14 | 81dd9256dc0ac |
15 | 3858605bbe641 |
hex | 1a3dcb510f488 |
461643302630536 has 32 divisors (see below), whose sum is σ = 932442869211840. Its totient is φ = 213002480674368.
The previous prime is 461643302630509. The next prime is 461643302630611. The reversal of 461643302630536 is 635036203346164.
It is a super-2 number, since 2×4616433026305362 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (52).
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 7 ways as a sum of consecutive naturals, for example, 662764836 + ... + 663461011.
It is an arithmetic number, because the mean of its divisors is an integer number (29138839662870).
Almost surely, 2461643302630536 is an apocalyptic number.
It is an amenable number.
461643302630536 is an abundant number, since it is smaller than the sum of its proper divisors (470799566581304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
461643302630536 is a wasteful number, since it uses less digits than its factorization.
461643302630536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1326229213 (or 1326229209 counting only the distinct ones).
The product of its (nonzero) digits is 16796160, while the sum is 52.
The spelling of 461643302630536 in words is "four hundred sixty-one trillion, six hundred forty-three billion, three hundred two million, six hundred thirty thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •