Base | Representation |
---|---|
bin | 1011101110010110… |
… | …10000011100100000 |
3 | 121020200001000002010 |
4 | 11313023100130200 |
5 | 100342332010234 |
6 | 2520330552520 |
7 | 311660401440 |
oct | 56713203440 |
9 | 17220030063 |
10 | 6294406944 |
11 | 2740035111 |
12 | 1277b98740 |
13 | 794088b67 |
14 | 439d68120 |
15 | 26c8de6e9 |
hex | 1772d0720 |
6294406944 has 384 divisors, whose sum is σ = 21528944640. Its totient is φ = 1566867456.
The previous prime is 6294406919. The next prime is 6294406957. The reversal of 6294406944 is 4496044926.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 6294406893 and 6294406902.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10201324 + ... + 10201940.
It is an arithmetic number, because the mean of its divisors is an integer number (56064960).
Almost surely, 26294406944 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 6294406944, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10764472320).
6294406944 is an abundant number, since it is smaller than the sum of its proper divisors (15234537696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6294406944 is a wasteful number, since it uses less digits than its factorization.
6294406944 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720 (or 712 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 48.
The square root of 6294406944 is about 79337.2985675716. The cubic root of 6294406944 is about 1846.3680331965.
The spelling of 6294406944 in words is "six billion, two hundred ninety-four million, four hundred six thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •