Base | Representation |
---|---|
bin | 10010001001101… |
… | …110110101010101 |
3 | 210020001021201210 |
4 | 102021232311111 |
5 | 1110430303023 |
6 | 50115212033 |
7 | 10355361450 |
oct | 2211566525 |
9 | 706037653 |
10 | 304541013 |
11 | 1469a6197 |
12 | 85ba7019 |
13 | 4b12a9aa |
14 | 2c636497 |
15 | 1bb09593 |
hex | 1226ed55 |
304541013 has 8 divisors (see below), whose sum is σ = 464062528. Its totient is φ = 174023424.
The previous prime is 304540997. The next prime is 304541051. The reversal of 304541013 is 310145403.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 304541013 - 24 = 304540997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 14501953 = 304541013 / (3 + 0 + 4 + 5 + 4 + 1 + 0 + 1 + 3).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (304541053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7250956 + ... + 7250997.
It is an arithmetic number, because the mean of its divisors is an integer number (58007816).
Almost surely, 2304541013 is an apocalyptic number.
It is an amenable number.
304541013 is a deficient number, since it is larger than the sum of its proper divisors (159521515).
304541013 is a wasteful number, since it uses less digits than its factorization.
304541013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14501963.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 304541013 is about 17451.1034894645. The cubic root of 304541013 is about 672.7937205006.
Adding to 304541013 its reverse (310145403), we get a palindrome (614686416).
The spelling of 304541013 in words is "three hundred four million, five hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •