Base | Representation |
---|---|
bin | 111001110101… |
… | …1101010110111 |
3 | 2010001200200010 |
4 | 1303223222313 |
5 | 30230403211 |
6 | 3001551303 |
7 | 515522223 |
oct | 163535267 |
9 | 63050603 |
10 | 30325431 |
11 | 16132a44 |
12 | a1a5533 |
13 | 638a156 |
14 | 4055783 |
15 | 29e04a6 |
hex | 1cebab7 |
30325431 has 16 divisors (see below), whose sum is σ = 42368256. Its totient is φ = 19257216.
The previous prime is 30325423. The next prime is 30325439. The reversal of 30325431 is 13452303.
It is an interprime number because it is at equal distance from previous prime (30325423) and next prime (30325439).
It is not a de Polignac number, because 30325431 - 23 = 30325423 is a prime.
It is a super-2 number, since 2×303254312 = 1839263530671522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30325398 and 30325407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30325439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18751 + ... + 20303.
It is an arithmetic number, because the mean of its divisors is an integer number (2648016).
Almost surely, 230325431 is an apocalyptic number.
30325431 is a deficient number, since it is larger than the sum of its proper divisors (12042825).
30325431 is a wasteful number, since it uses less digits than its factorization.
30325431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1862.
The product of its (nonzero) digits is 1080, while the sum is 21.
The square root of 30325431 is about 5506.8530941001. The cubic root of 30325431 is about 311.8427564815.
Adding to 30325431 its reverse (13452303), we get a palindrome (43777734).
The spelling of 30325431 in words is "thirty million, three hundred twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •