Base | Representation |
---|---|
bin | 1010000100101011110 |
3 | 121202210010 |
4 | 1100211132 |
5 | 41030303 |
6 | 11024050 |
7 | 2543220 |
oct | 1204536 |
9 | 552703 |
10 | 330078 |
11 | 205aa1 |
12 | 13b026 |
13 | b7318 |
14 | 88410 |
15 | 67c03 |
hex | 5095e |
330078 has 32 divisors (see below), whose sum is σ = 783360. Its totient is φ = 90720.
The previous prime is 330067. The next prime is 330097. The reversal of 330078 is 870033.
330078 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
330078 is a nontrivial binomial coefficient, being equal to C(813, 2).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a nialpdrome in base 14.
It is a congruent number.
It is an unprimeable number.
330078 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1083 + ... + 1353.
It is an arithmetic number, because the mean of its divisors is an integer number (24480).
2330078 is an apocalyptic number.
330078 is the 812-nd triangular number.
It is a practical number, because each smaller number is the sum of distinct divisors of 330078, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (391680).
330078 is an abundant number, since it is smaller than the sum of its proper divisors (453282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330078 is a wasteful number, since it uses less digits than its factorization.
330078 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312.
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 330078 is about 574.5241509284. The cubic root of 330078 is about 69.1096764471.
The spelling of 330078 in words is "three hundred thirty thousand, seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •