Base | Representation |
---|---|
bin | 111001100101… |
… | …1110100001001 |
3 | 2002211001200121 |
4 | 1303023310021 |
5 | 30212214303 |
6 | 2555103241 |
7 | 514436635 |
oct | 163136411 |
9 | 62731617 |
10 | 30194953 |
11 | 16053a08 |
12 | a141b21 |
13 | 6342949 |
14 | 401ddc5 |
15 | 29b69bd |
hex | 1ccbd09 |
30194953 has 2 divisors, whose sum is σ = 30194954. Its totient is φ = 30194952.
The previous prime is 30194921. The next prime is 30194959. The reversal of 30194953 is 35949103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30173049 + 21904 = 5493^2 + 148^2 .
It is an emirp because it is prime and its reverse (35949103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30194953 - 25 = 30194921 is a prime.
It is a super-3 number, since 3×301949533 (a number of 23 digits) contains 333 as substring.
It is equal to p1869226 and since 30194953 and 1869226 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (30194959) 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 as a sum of consecutive naturals, namely, 15097476 + 15097477.
It is an arithmetic number, because the mean of its divisors is an integer number (15097477).
Almost surely, 230194953 is an apocalyptic number.
It is an amenable number.
30194953 is a deficient number, since it is larger than the sum of its proper divisors (1).
30194953 is an equidigital number, since it uses as much as digits as its factorization.
30194953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 34.
The square root of 30194953 is about 5494.9934485857. The cubic root of 30194953 is about 311.3948693094.
The spelling of 30194953 in words is "thirty million, one hundred ninety-four thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •