Base | Representation |
---|---|
bin | 110000100000110111110… |
… | …1101000001000010100000 |
3 | 212121102101220212011012000 |
4 | 1201001233231001002200 |
5 | 1333220333302040404 |
6 | 22103025433004000 |
7 | 1255502625024351 |
oct | 141015755010240 |
9 | 25542356764160 |
10 | 6667663315104 |
11 | 2140816130080 |
12 | 8b82a2b53600 |
13 | 3949b12b6b5c |
14 | 190a065cbd28 |
15 | b86941ea339 |
hex | 6106fb410a0 |
6667663315104 has 384 divisors, whose sum is σ = 21551631897600. Its totient is φ = 1988527242240.
The previous prime is 6667663315081. The next prime is 6667663315109. The reversal of 6667663315104 is 4015133667666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (6667663315109) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 801686754 + ... + 801695070.
It is an arithmetic number, because the mean of its divisors is an integer number (56124041400).
Almost surely, 26667663315104 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 6667663315104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10775815948800).
6667663315104 is an abundant number, since it is smaller than the sum of its proper divisors (14883968582496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6667663315104 is a wasteful number, since it uses less digits than its factorization.
6667663315104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9673 (or 9659 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 54.
The spelling of 6667663315104 in words is "six trillion, six hundred sixty-seven billion, six hundred sixty-three million, three hundred fifteen thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •