Base | Representation |
---|---|
bin | 1100000000001100… |
… | …10001100011000000 |
3 | 121122002200222102101 |
4 | 12000012101203000 |
5 | 101144142030210 |
6 | 2543235200144 |
7 | 315455623651 |
oct | 60006214300 |
9 | 17562628371 |
10 | 6444095680 |
11 | 2807584510 |
12 | 12ba146054 |
13 | 7b90a9189 |
14 | 451bb1528 |
15 | 27ab0ba3a |
hex | 1801918c0 |
6444095680 has 112 divisors (see below), whose sum is σ = 16768303776. Its totient is φ = 2339348480.
The previous prime is 6444095611. The next prime is 6444095687. The reversal of 6444095680 is 865904446.
It is a self number, because there is not a number n which added to its sum of digits gives 6444095680.
It is not an unprimeable number, because it can be changed into a prime (6444095687) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2804292 + ... + 2806588.
It is an arithmetic number, because the mean of its divisors is an integer number (149716998).
Almost surely, 26444095680 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 6444095680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8384151888).
6444095680 is an abundant number, since it is smaller than the sum of its proper divisors (10324208096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6444095680 is a wasteful number, since it uses less digits than its factorization.
6444095680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3122 (or 3112 counting only the distinct ones).
The product of its (nonzero) digits is 829440, while the sum is 46.
The square root of 6444095680 is about 80275.1249142597. The cubic root of 6444095680 is about 1860.8898197448.
The spelling of 6444095680 in words is "six billion, four hundred forty-four million, ninety-five thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •