Base | Representation |
---|---|
bin | 10010010011100100011… |
… | …01010101100101001000 |
3 | 2020010111210022212020110 |
4 | 21021302031111211020 |
5 | 40301123204332404 |
6 | 1200541112354320 |
7 | 63304513020210 |
oct | 11116215254510 |
9 | 2203453285213 |
10 | 628981324104 |
11 | 222827618321 |
12 | a1a986a59a0 |
13 | 4740ac768b3 |
14 | 2262b2bd240 |
15 | 11564326b89 |
hex | 9272355948 |
628981324104 has 512 divisors, whose sum is σ = 1991983104000. Its totient is φ = 161464762368.
The previous prime is 628981324073. The next prime is 628981324117. The reversal of 628981324104 is 401423189826.
It is a super-4 number, since 4×6289813241044 (a number of 48 digits) contains 4444 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1642248697 + ... + 1642249079.
It is an arithmetic number, because the mean of its divisors is an integer number (3890592000).
Almost surely, 2628981324104 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 628981324104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (995991552000).
628981324104 is an abundant number, since it is smaller than the sum of its proper divisors (1363001779896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
628981324104 is a wasteful number, since it uses less digits than its factorization.
628981324104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 717 (or 713 counting only the distinct ones).
The product of its (nonzero) digits is 663552, while the sum is 48.
The spelling of 628981324104 in words is "six hundred twenty-eight billion, nine hundred eighty-one million, three hundred twenty-four thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •