Base | Representation |
---|---|
bin | 10010001000110… |
… | …010010011110011 |
3 | 210012120200200002 |
4 | 102020302103303 |
5 | 1110344334412 |
6 | 50110020215 |
7 | 10353306626 |
oct | 2210622363 |
9 | 705520602 |
10 | 304293107 |
11 | 146846a08 |
12 | 85aa766b |
13 | 4b071bc1 |
14 | 2c5addbd |
15 | 1baaadc2 |
hex | 122324f3 |
304293107 has 8 divisors (see below), whose sum is σ = 306923760. Its totient is φ = 301674240.
The previous prime is 304293097. The next prime is 304293109. The reversal of 304293107 is 701392403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 304293107 - 24 = 304293091 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 304293107.
It is not an unprimeable number, because it can be changed into a prime (304293109) by changing a digit.
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, 53444 + ... + 58862.
It is an arithmetic number, because the mean of its divisors is an integer number (38365470).
Almost surely, 2304293107 is an apocalyptic number.
304293107 is a deficient number, since it is larger than the sum of its proper divisors (2630653).
304293107 is a wasteful number, since it uses less digits than its factorization.
304293107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5893.
The product of its (nonzero) digits is 4536, while the sum is 29.
The square root of 304293107 is about 17443.9991687686. Note that the first 3 decimals coincide. The cubic root of 304293107 is about 672.6111124984.
Adding to 304293107 its sum of digits (29), we get a square (304293136 = 174442).
The spelling of 304293107 in words is "three hundred four million, two hundred ninety-three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •