Base | Representation |
---|---|
bin | 10010000111101… |
… | …110011111011000 |
3 | 210012001120121200 |
4 | 102013232133120 |
5 | 1110311442240 |
6 | 50100034200 |
7 | 10351042020 |
oct | 2207563730 |
9 | 705046550 |
10 | 304015320 |
11 | 146677234 |
12 | 85992960 |
13 | 4aca562b |
14 | 2c53aa80 |
15 | 1ba53930 |
hex | 121ee7d8 |
304015320 has 96 divisors (see below), whose sum is σ = 1129209120. Its totient is φ = 69488640.
The previous prime is 304015319. The next prime is 304015331. The reversal of 304015320 is 23510403.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 304015293 and 304015302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 57801 + ... + 62840.
It is an arithmetic number, because the mean of its divisors is an integer number (11762595).
Almost surely, 2304015320 is an apocalyptic number.
304015320 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
304015320 is an abundant number, since it is smaller than the sum of its proper divisors (825193800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
304015320 is a wasteful number, since it uses less digits than its factorization.
304015320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120665 (or 120658 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 18.
The square root of 304015320 is about 17436.0350997582. The cubic root of 304015320 is about 672.4063762278.
Adding to 304015320 its reverse (23510403), we get a palindrome (327525723).
It can be divided in two parts, 30401 and 5320, that added together give a square (35721 = 1892).
The spelling of 304015320 in words is "three hundred four million, fifteen thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •