Base | Representation |
---|---|
bin | 101101011010000010010… |
… | …000101110001100000000 |
3 | 102001022010021112220021010 |
4 | 231122002100232030000 |
5 | 402110414402202324 |
6 | 10345243253000520 |
7 | 441302504435100 |
oct | 55320220561400 |
9 | 12038107486233 |
10 | 3120331678464 |
11 | aa3363981830 |
12 | 4248a8923140 |
13 | 198327657000 |
14 | ab04c2db200 |
15 | 562788b4829 |
hex | 2d68242e300 |
3120331678464 has 1728 divisors, whose sum is σ = 11819168040960. Its totient is φ = 722183454720.
The previous prime is 3120331678439. The next prime is 3120331678469. The reversal of 3120331678464 is 4648761330213.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (3120331678469) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 42744269532 + ... + 42744269604.
It is an arithmetic number, because the mean of its divisors is an integer number (6839796320).
Almost surely, 23120331678464 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 3120331678464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5909584020480).
3120331678464 is an abundant number, since it is smaller than the sum of its proper divisors (8698836362496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3120331678464 is a wasteful number, since it uses less digits than its factorization.
3120331678464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203 (or 156 counting only the distinct ones).
The product of its (nonzero) digits is 1741824, while the sum is 48.
The spelling of 3120331678464 in words is "three trillion, one hundred twenty billion, three hundred thirty-one million, six hundred seventy-eight thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •