Base | Representation |
---|---|
bin | 101110100111000110100… |
… | …1010001000000000000000 |
3 | 211200102102121122221201010 |
4 | 1131032031022020000000 |
5 | 1314424311101330000 |
6 | 21342541253240520 |
7 | 1230554504426115 |
oct | 135161512100000 |
9 | 24612377587633 |
10 | 6406164480000 |
11 | 204a92592791a |
12 | 875683633140 |
13 | 376138b6582c |
14 | 1820ba97890c |
15 | b198bb58d50 |
hex | 5d38d288000 |
6406164480000 has 640 divisors, whose sum is σ = 21541012669440. Its totient is φ = 1692794880000.
The previous prime is 6406164479999. The next prime is 6406164480013. The reversal of 6406164480000 is 844616046.
It is a tau number, because it is divible by the number of its divisors (640).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 7802879590 + ... + 7802880410.
It is an arithmetic number, because the mean of its divisors is an integer number (33657832296).
Almost surely, 26406164480000 is an apocalyptic number.
6406164480000 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 6406164480000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10770506334720).
6406164480000 is an abundant number, since it is smaller than the sum of its proper divisors (15134848189440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6406164480000 is an frugal number, since it uses more digits than its factorization.
6406164480000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1001 (or 958 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 39.
The spelling of 6406164480000 in words is "six trillion, four hundred six billion, one hundred sixty-four million, four hundred eighty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •