Base | Representation |
---|---|
bin | 10010101101000101111… |
… | …00101110000000000000 |
3 | 2021102212202020112120000 |
4 | 21112202330232000000 |
5 | 41012204043000102 |
6 | 1211124523320000 |
7 | 64301210316063 |
oct | 11264274560000 |
9 | 2242782215500 |
10 | 642683953152 |
11 | 22861937833a |
12 | a4681680000 |
13 | 487b2a98517 |
14 | 2316b0a88da |
15 | 11ab72ba01c |
hex | 95a2f2e000 |
642683953152 has 280 divisors, whose sum is σ = 1924268279472. Its totient is φ = 213752217600.
The previous prime is 642683953151. The next prime is 642683953159. The reversal of 642683953152 is 251359386246.
It is a happy number.
642683953152 is a `hidden beast` number, since 6 + 4 + 26 + 8 + 39 + 531 + 52 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (642683953151) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 425336077 + ... + 425337587.
Almost surely, 2642683953152 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 642683953152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (962134139736).
642683953152 is an abundant number, since it is smaller than the sum of its proper divisors (1281584326320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642683953152 is an equidigital number, since it uses as much as digits as its factorization.
642683953152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2190 (or 2157 counting only the distinct ones).
The product of its digits is 9331200, while the sum is 54.
The spelling of 642683953152 in words is "six hundred forty-two billion, six hundred eighty-three million, nine hundred fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •