Base | Representation |
---|---|
bin | 10011100100001… |
… | …101111011000000 |
3 | 211212200101212101 |
4 | 103210031323000 |
5 | 1133013330222 |
6 | 52323440144 |
7 | 11064114031 |
oct | 2344157300 |
9 | 755611771 |
10 | 328261312 |
11 | 159327645 |
12 | 91b26054 |
13 | 53014582 |
14 | 3184ca88 |
15 | 1dc42927 |
hex | 1390dec0 |
328261312 has 56 divisors (see below), whose sum is σ = 673711632. Its totient is φ = 158592000.
The previous prime is 328261303. The next prime is 328261331. The reversal of 328261312 is 213162823.
It is a super-2 number, since 2×3282613122 = 215510977911922688, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 277362 + ... + 278542.
Almost surely, 2328261312 is an apocalyptic number.
328261312 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 328261312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (336855816).
328261312 is an abundant number, since it is smaller than the sum of its proper divisors (345450320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
328261312 is a wasteful number, since it uses less digits than its factorization.
328261312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1337 (or 1327 counting only the distinct ones).
The product of its digits is 3456, while the sum is 28.
The square root of 328261312 is about 18117.9831107108. The cubic root of 328261312 is about 689.8265418495.
The spelling of 328261312 in words is "three hundred twenty-eight million, two hundred sixty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •