Base | Representation |
---|---|
bin | 111001110101… |
… | …0010110000101 |
3 | 2010001102020011 |
4 | 1303222112011 |
5 | 30230220010 |
6 | 3001510221 |
7 | 515500342 |
oct | 163522605 |
9 | 63042204 |
10 | 30320005 |
11 | 16129961 |
12 | a1a2371 |
13 | 6387841 |
14 | 40537c9 |
15 | 29dda8a |
hex | 1cea585 |
30320005 has 4 divisors (see below), whose sum is σ = 36384012. Its totient is φ = 24256000.
The previous prime is 30319987. The next prime is 30320009. The reversal of 30320005 is 50002303.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50002303 = 13 ⋅3846331.
It can be written as a sum of positive squares in 2 ways, for example, as 11249316 + 19070689 = 3354^2 + 4367^2 .
It is not a de Polignac number, because 30320005 - 25 = 30319973 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 (30320009) 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, 3031996 + ... + 3032005.
It is an arithmetic number, because the mean of its divisors is an integer number (9096003).
Almost surely, 230320005 is an apocalyptic number.
It is an amenable number.
30320005 is a deficient number, since it is larger than the sum of its proper divisors (6064007).
30320005 is an equidigital number, since it uses as much as digits as its factorization.
30320005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6064006.
The product of its (nonzero) digits is 90, while the sum is 13.
The square root of 30320005 is about 5506.3604131949. The cubic root of 30320005 is about 311.8241564741.
Adding to 30320005 its reverse (50002303), we get a palindrome (80322308).
The spelling of 30320005 in words is "thirty million, three hundred twenty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •