Base | Representation |
---|---|
bin | 110010110110111111110… |
… | …0110100100100000000000 |
3 | 220202020112210012002212100 |
4 | 1211231333212210200000 |
5 | 1404011111431424000 |
6 | 22511104050230400 |
7 | 1321005006554310 |
oct | 145557746444000 |
9 | 26666483162770 |
10 | 6990052608000 |
11 | 2255512515520 |
12 | 94a876585400 |
13 | 3b920b7ca667 |
14 | 1a246b089440 |
15 | c1c62283a00 |
hex | 65b7f9a4800 |
6990052608000 has 3456 divisors, whose sum is σ = 33249998396160. Its totient is φ = 1371340800000.
The previous prime is 6990052607947. The next prime is 6990052608023. The reversal of 6990052608000 is 8062500996.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 170489087980 + ... + 170489088020.
It is an arithmetic number, because the mean of its divisors is an integer number (9620948610).
Almost surely, 26990052608000 is an apocalyptic number.
6990052608000 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 6990052608000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16624999198080).
6990052608000 is an abundant number, since it is smaller than the sum of its proper divisors (26259945788160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6990052608000 is a wasteful number, since it uses less digits than its factorization.
6990052608000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164 (or 100 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The spelling of 6990052608000 in words is "six trillion, nine hundred ninety billion, fifty-two million, six hundred eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •