Base | Representation |
---|---|
bin | 110000100100001101111… |
… | …0000000000000000000000 |
3 | 212122002221101222122000000 |
4 | 1201020123300000000000 |
5 | 1333330040223330403 |
6 | 22110214212000000 |
7 | 1256145606131025 |
oct | 141103360000000 |
9 | 25562841878000 |
10 | 6674844745728 |
11 | 2143870934205 |
12 | 8b9768000000 |
13 | 395587074ba3 |
14 | 1910c829554c |
15 | b89649017a3 |
hex | 6121bc00000 |
6674844745728 has 644 divisors, whose sum is σ = 20904744188280. Its totient is φ = 2128122740736.
The previous prime is 6674844745697. The next prime is 6674844745763. The reversal of 6674844745728 is 8275474484766.
It is a happy number.
6674844745728 is a `hidden beast` number, since 6 + 6 + 7 + 4 + 8 + 4 + 47 + 4 + 572 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 113132961763 + ... + 113132961821.
Almost surely, 26674844745728 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 6674844745728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10452372094140).
6674844745728 is an abundant number, since it is smaller than the sum of its proper divisors (14229899442552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6674844745728 is an frugal number, since it uses more digits than its factorization.
6674844745728 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158 (or 101 counting only the distinct ones).
The product of its digits is 2023096320, while the sum is 72.
The spelling of 6674844745728 in words is "six trillion, six hundred seventy-four billion, eight hundred forty-four million, seven hundred forty-five thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •