Base | Representation |
---|---|
bin | 111001110111… |
… | …1110001001111 |
3 | 2010002112201001 |
4 | 1303233301033 |
5 | 30231422343 |
6 | 3002201131 |
7 | 515622202 |
oct | 163576117 |
9 | 63075631 |
10 | 30342223 |
11 | 1614461a |
12 | a1b31a7 |
13 | 63949a2 |
14 | 405b939 |
15 | 29e544d |
hex | 1cefc4f |
30342223 has 4 divisors (see below), whose sum is σ = 30795160. Its totient is φ = 29889288.
The previous prime is 30342203. The next prime is 30342233. The reversal of 30342223 is 32224303.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32224303 = 487 ⋅66169.
It is a cyclic number.
It is not a de Polignac number, because 30342223 - 217 = 30211151 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30342223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30342203) 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 3 ways as a sum of consecutive naturals, for example, 226368 + ... + 226501.
It is an arithmetic number, because the mean of its divisors is an integer number (7698790).
Almost surely, 230342223 is an apocalyptic number.
30342223 is a deficient number, since it is larger than the sum of its proper divisors (452937).
30342223 is an equidigital number, since it uses as much as digits as its factorization.
30342223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452936.
The product of its (nonzero) digits is 864, while the sum is 19.
The square root of 30342223 is about 5508.3775288192. The cubic root of 30342223 is about 311.9003044115.
Adding to 30342223 its reverse (32224303), we get a palindrome (62566526).
The spelling of 30342223 in words is "thirty million, three hundred forty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •