Base | Representation |
---|---|
bin | 10010001011011… |
… | …000100010010010 |
3 | 210020212021122020 |
4 | 102023120202102 |
5 | 1111033131340 |
6 | 50132352310 |
7 | 10362143640 |
oct | 2213304222 |
9 | 706767566 |
10 | 304973970 |
11 | 147171504 |
12 | 86175696 |
13 | 4b24ca92 |
14 | 2c70a190 |
15 | 1bb929d0 |
hex | 122d8892 |
304973970 has 128 divisors (see below), whose sum is σ = 875888640. Its totient is φ = 66493440.
The previous prime is 304973969. The next prime is 304973987. The reversal of 304973970 is 79379403.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 513994 + ... + 514586.
It is an arithmetic number, because the mean of its divisors is an integer number (6842880).
Almost surely, 2304973970 is an apocalyptic number.
304973970 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 304973970, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (437944320).
304973970 is an abundant number, since it is smaller than the sum of its proper divisors (570914670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304973970 is a wasteful number, since it uses less digits than its factorization.
304973970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720.
The product of its (nonzero) digits is 142884, while the sum is 42.
The square root of 304973970 is about 17463.5039439398. The cubic root of 304973970 is about 673.1123998766.
The spelling of 304973970 in words is "three hundred four million, nine hundred seventy-three thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •