Base | Representation |
---|---|
bin | 10011101100110… |
… | …001100001101101 |
3 | 212000220100200001 |
4 | 103230301201231 |
5 | 1134102114201 |
6 | 52443504301 |
7 | 11122145251 |
oct | 2354614155 |
9 | 760810601 |
10 | 330504301 |
11 | 15a619856 |
12 | 92828091 |
13 | 5361b49a |
14 | 31c74261 |
15 | 1e037301 |
hex | 13b3186d |
330504301 has 4 divisors (see below), whose sum is σ = 330543004. Its totient is φ = 330465600.
The previous prime is 330504289. The next prime is 330504323. The reversal of 330504301 is 103405033.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 239320900 + 91183401 = 15470^2 + 9549^2 .
It is a cyclic number.
It is not a de Polignac number, because 330504301 - 27 = 330504173 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330504001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 270 + ... + 25711.
It is an arithmetic number, because the mean of its divisors is an integer number (82635751).
Almost surely, 2330504301 is an apocalyptic number.
It is an amenable number.
330504301 is a deficient number, since it is larger than the sum of its proper divisors (38703).
330504301 is a wasteful number, since it uses less digits than its factorization.
330504301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38702.
The product of its (nonzero) digits is 540, while the sum is 19.
The square root of 330504301 is about 18179.7772538610. Note that the first 3 decimals coincide. The cubic root of 330504301 is about 691.3941573085.
Adding to 330504301 its reverse (103405033), we get a palindrome (433909334).
The spelling of 330504301 in words is "three hundred thirty million, five hundred four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •