Base | Representation |
---|---|
bin | 10010101011111000111… |
… | …01000010011111111100 |
3 | 2021101012201222112012112 |
4 | 21111330131002133330 |
5 | 41004343224124200 |
6 | 1210540452553152 |
7 | 64246205633012 |
oct | 11257435023774 |
9 | 2241181875175 |
10 | 642038114300 |
11 | 228317861020 |
12 | a45213227b8 |
13 | 4870c04055b |
14 | 231093cc8b2 |
15 | 11a7a745535 |
hex | 957c7427fc |
642038114300 has 288 divisors, whose sum is σ = 1696638908160. Its totient is φ = 207843840000.
The previous prime is 642038114293. The next prime is 642038114371. The reversal of 642038114300 is 3411830246.
It is a congruent number.
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 95 ways as a sum of consecutive naturals, for example, 344995370 + ... + 344997230.
It is an arithmetic number, because the mean of its divisors is an integer number (5891107320).
Almost surely, 2642038114300 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 642038114300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (848319454080).
642038114300 is an abundant number, since it is smaller than the sum of its proper divisors (1054600793860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642038114300 is a wasteful number, since it uses less digits than its factorization.
642038114300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2893 (or 2886 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 642038114300 its reverse (3411830246), we get a palindrome (645449944546).
The spelling of 642038114300 in words is "six hundred forty-two billion, thirty-eight million, one hundred fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •