Base | Representation |
---|---|
bin | 10010001001101… |
… | …010000011010001 |
3 | 210020000021212022 |
4 | 102021222003101 |
5 | 1110424141200 |
6 | 50114541225 |
7 | 10355250365 |
oct | 2211520321 |
9 | 706007768 |
10 | 304521425 |
11 | 1469924aa |
12 | 85b97815 |
13 | 4b121ac0 |
14 | 2c62d2a5 |
15 | 1bb03885 |
hex | 1226a0d1 |
304521425 has 24 divisors (see below), whose sum is σ = 430581816. Its totient is φ = 211645440.
The previous prime is 304521409. The next prime is 304521443. The reversal of 304521425 is 524125403.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 21743569 + 282777856 = 4663^2 + 16816^2 .
It is not a de Polignac number, because 304521425 - 24 = 304521409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 304521394 and 304521403.
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 23 ways as a sum of consecutive naturals, for example, 22034 + ... + 33083.
It is an arithmetic number, because the mean of its divisors is an integer number (17940909).
Almost surely, 2304521425 is an apocalyptic number.
It is an amenable number.
304521425 is a deficient number, since it is larger than the sum of its proper divisors (126060391).
304521425 is a wasteful number, since it uses less digits than its factorization.
304521425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55157 (or 55152 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 304521425 is about 17450.5422551851. The cubic root of 304521425 is about 672.7792955514.
Adding to 304521425 its reverse (524125403), we get a palindrome (828646828).
The spelling of 304521425 in words is "three hundred four million, five hundred twenty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •