Base | Representation |
---|---|
bin | 111001110110… |
… | …0110100011101 |
3 | 2010001221010120 |
4 | 1303230310131 |
5 | 30231031031 |
6 | 3002025153 |
7 | 515542032 |
oct | 163546435 |
9 | 63057116 |
10 | 30330141 |
11 | 16136536 |
12 | a1a81b9 |
13 | 638c33a |
14 | 4057389 |
15 | 29e1a96 |
hex | 1cecd1d |
30330141 has 4 divisors (see below), whose sum is σ = 40440192. Its totient is φ = 20220092.
The previous prime is 30330133. The next prime is 30330149. The reversal of 30330141 is 14103303.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (30330133) and next prime (30330149).
It is a cyclic number.
It is not a de Polignac number, because 30330141 - 23 = 30330133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30330141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30330149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5055021 + ... + 5055026.
It is an arithmetic number, because the mean of its divisors is an integer number (10110048).
Almost surely, 230330141 is an apocalyptic number.
It is an amenable number.
30330141 is a deficient number, since it is larger than the sum of its proper divisors (10110051).
30330141 is a wasteful number, since it uses less digits than its factorization.
30330141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10110050.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 30330141 is about 5507.2807264566. The cubic root of 30330141 is about 311.8589002844.
Adding to 30330141 its reverse (14103303), we get a palindrome (44433444).
The spelling of 30330141 in words is "thirty million, three hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •