Base | Representation |
---|---|
bin | 111001011111… |
… | …1101100110101 |
3 | 2002201112121211 |
4 | 1302333230311 |
5 | 30204122313 |
6 | 2554041421 |
7 | 514142161 |
oct | 162775465 |
9 | 62645554 |
10 | 30145333 |
11 | 1601a6a9 |
12 | a119271 |
13 | 632619a |
14 | 4009ca1 |
15 | 29a6e3d |
hex | 1cbfb35 |
30145333 has 2 divisors, whose sum is σ = 30145334. Its totient is φ = 30145332.
The previous prime is 30145321. The next prime is 30145439. The reversal of 30145333 is 33354103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24029604 + 6115729 = 4902^2 + 2473^2 .
It is an emirp because it is prime and its reverse (33354103) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30145333 is a prime.
It is a super-2 number, since 2×301453332 = 1817482203361778, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30145303) 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 as a sum of consecutive naturals, namely, 15072666 + 15072667.
It is an arithmetic number, because the mean of its divisors is an integer number (15072667).
Almost surely, 230145333 is an apocalyptic number.
It is an amenable number.
30145333 is a deficient number, since it is larger than the sum of its proper divisors (1).
30145333 is an equidigital number, since it uses as much as digits as its factorization.
30145333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 22.
The square root of 30145333 is about 5490.4765731219. The cubic root of 30145333 is about 311.2242018800.
Adding to 30145333 its reverse (33354103), we get a palindrome (63499436).
The spelling of 30145333 in words is "thirty million, one hundred forty-five thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •