Base | Representation |
---|---|
bin | 110000010000000101001… |
… | …0000000000001011110000 |
3 | 212110222022201010201200020 |
4 | 1200200022100000023300 |
5 | 1332123004434102430 |
6 | 22034303214323440 |
7 | 1253055160306263 |
oct | 140401220001360 |
9 | 25428281121606 |
10 | 6631601472240 |
11 | 21274a0166858 |
12 | 8b12b9ab9580 |
13 | 3914850b22b4 |
14 | 18cd85076cda |
15 | b778331eb10 |
hex | 6080a4002f0 |
6631601472240 has 80 divisors (see below), whose sum is σ = 20945850727968. Its totient is φ = 1735060507648.
The previous prime is 6631601472191. The next prime is 6631601472283. The reversal of 6631601472240 is 422741061366.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 6631601472192 and 6631601472201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 260663439 + ... + 260688878.
Almost surely, 26631601472240 is an apocalyptic number.
6631601472240 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6631601472240 is an abundant number, since it is smaller than the sum of its proper divisors (14314249255728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6631601472240 is a wasteful number, since it uses less digits than its factorization.
6631601472240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521352386 (or 521352380 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 42.
The spelling of 6631601472240 in words is "six trillion, six hundred thirty-one billion, six hundred one million, four hundred seventy-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •