Base | Representation |
---|---|
bin | 10010001000100… |
… | …011111000011101 |
3 | 210012110200121102 |
4 | 102020203320131 |
5 | 1110340442023 |
6 | 50104442445 |
7 | 10352642426 |
oct | 2210437035 |
9 | 705420542 |
10 | 304234013 |
11 | 146806576 |
12 | 85a79425 |
13 | 4b051035 |
14 | 2c59664d |
15 | 1ba98628 |
hex | 12223e1d |
304234013 has 4 divisors (see below), whose sum is σ = 304740828. Its totient is φ = 303727200.
The previous prime is 304234009. The next prime is 304234033. The reversal of 304234013 is 310432403.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 105226564 + 199007449 = 10258^2 + 14107^2 .
It is a cyclic number.
It is not a de Polignac number, because 304234013 - 22 = 304234009 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 (304234003) 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 3 ways as a sum of consecutive naturals, for example, 252506 + ... + 253707.
It is an arithmetic number, because the mean of its divisors is an integer number (76185207).
Almost surely, 2304234013 is an apocalyptic number.
It is an amenable number.
304234013 is a deficient number, since it is larger than the sum of its proper divisors (506815).
304234013 is an equidigital number, since it uses as much as digits as its factorization.
304234013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506814.
The product of its (nonzero) digits is 864, while the sum is 20.
The square root of 304234013 is about 17442.3052662198. The cubic root of 304234013 is about 672.5675691149.
Adding to 304234013 its reverse (310432403), we get a palindrome (614666416).
The spelling of 304234013 in words is "three hundred four million, two hundred thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •