Base | Representation |
---|---|
bin | 10010010111011000011… |
… | …01001001101011000000 |
3 | 2020022210102200122000010 |
4 | 21023230031021223000 |
5 | 40314321143030210 |
6 | 1201520150024520 |
7 | 63406315212243 |
oct | 11135415115300 |
9 | 2208712618003 |
10 | 631028095680 |
11 | 223687a00084 |
12 | a236a048140 |
13 | 47676018a38 |
14 | 2278307125a |
15 | 11633d77920 |
hex | 92ec349ac0 |
631028095680 has 448 divisors, whose sum is σ = 2134334251008. Its totient is φ = 157616701440.
The previous prime is 631028095673. The next prime is 631028095693. The reversal of 631028095680 is 86590820136.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
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 63 ways as a sum of consecutive naturals, for example, 346147249 + ... + 346149071.
Almost surely, 2631028095680 is an apocalyptic number.
631028095680 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 631028095680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1067167125504).
631028095680 is an abundant number, since it is smaller than the sum of its proper divisors (1503306155328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
631028095680 is a wasteful number, since it uses less digits than its factorization.
631028095680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2184 (or 2174 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 48.
The spelling of 631028095680 in words is "six hundred thirty-one billion, twenty-eight million, ninety-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •