Base | Representation |
---|---|
bin | 110000100000001101011… |
… | …1101000100011100100000 |
3 | 212121021201211101102122212 |
4 | 1201000122331010130200 |
5 | 1333204430303210000 |
6 | 22102232401421252 |
7 | 1255422451325243 |
oct | 141003275043440 |
9 | 25537654342585 |
10 | 6666241460000 |
11 | 2140156574311 |
12 | 8b7b6693a828 |
13 | 394815855785 |
14 | 19090d82b25a |
15 | b860e489c35 |
hex | 6101af44720 |
6666241460000 has 120 divisors (see below), whose sum is σ = 16452702249984. Its totient is φ = 2657920160000.
The previous prime is 6666241459967. The next prime is 6666241460003. The reversal of 6666241460000 is 641426666.
It is a self number, because there is not a number n which added to its sum of digits gives 6666241460000.
It is not an unprimeable number, because it can be changed into a prime (6666241460003) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5684129 + ... + 6755871.
Almost surely, 26666241460000 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 6666241460000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8226351124992).
6666241460000 is an abundant number, since it is smaller than the sum of its proper divisors (9786460789984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6666241460000 is a wasteful number, since it uses less digits than its factorization.
6666241460000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1072084 (or 1072061 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 41.
Adding to 6666241460000 its reverse (641426666), we get a palindrome (6666882886666).
The spelling of 6666241460000 in words is "six trillion, six hundred sixty-six billion, two hundred forty-one million, four hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •