Base | Representation |
---|---|
bin | 10010101100000011011… |
… | …10011100100100000000 |
3 | 2021101102220102012210221 |
4 | 21112001232130210000 |
5 | 41010033400013314 |
6 | 1210553332432424 |
7 | 64251331506442 |
oct | 11260156344400 |
9 | 2241386365727 |
10 | 642126563584 |
11 | 228362783300 |
12 | a4546a78714 |
13 | 4872446b6cc |
14 | 23117054492 |
15 | 11a833b7824 |
hex | 9581b9c900 |
642126563584 has 243 divisors, whose sum is σ = 1468469540811. Its totient is φ = 280016056320.
The previous prime is 642126563579. The next prime is 642126563591. The reversal of 642126563584 is 485365621246.
The square root of 642126563584 is 801328.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 22644230400 + 619482333184 = 150480^2 + 787072^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4089978034 + ... + 4089978190.
Almost surely, 2642126563584 is an apocalyptic number.
642126563584 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
642126563584 is the 801328-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 642126563584
642126563584 is an abundant number, since it is smaller than the sum of its proper divisors (826342977227).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642126563584 is an equidigital number, since it uses as much as digits as its factorization.
642126563584 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410 (or 199 counting only the distinct ones).
The product of its digits is 8294400, while the sum is 52.
The spelling of 642126563584 in words is "six hundred forty-two billion, one hundred twenty-six million, five hundred sixty-three thousand, five hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •