Base | Representation |
---|---|
bin | 1001100100011001011… |
… | …11001000000000000000 |
3 | 1011102122011002100200011 |
4 | 10302030233020000000 |
5 | 20341314320201042 |
6 | 411012220034304 |
7 | 32516304440422 |
oct | 4621457100000 |
9 | 1142564070604 |
10 | 328778678272 |
11 | 117485aa1230 |
12 | 53877392994 |
13 | 25008175615 |
14 | 11cad2aa812 |
15 | 8843e89a17 |
hex | 4c8cbc8000 |
328778678272 has 128 divisors (see below), whose sum is σ = 718831919520. Its totient is φ = 149131100160.
The previous prime is 328778678237. The next prime is 328778678299. The reversal of 328778678272 is 272876877823.
It is a tau number, because it is divible by the number of its divisors (128).
It is a junction number, because it is equal to n+sod(n) for n = 328778678198 and 328778678207.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 318275068 + ... + 318276100.
Almost surely, 2328778678272 is an apocalyptic number.
328778678272 is a gapful number since it is divisible by the number (32) 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 328778678272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (359415959760).
328778678272 is an abundant number, since it is smaller than the sum of its proper divisors (390053241248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
328778678272 is an equidigital number, since it uses as much as digits as its factorization.
328778678272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1957 (or 1929 counting only the distinct ones).
The product of its digits is 177020928, while the sum is 67.
The spelling of 328778678272 in words is "three hundred twenty-eight billion, seven hundred seventy-eight million, six hundred seventy-eight thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •