Base | Representation |
---|---|
bin | 111001100110… |
… | …1100110100001 |
3 | 2002211102201201 |
4 | 1303031212201 |
5 | 30212433043 |
6 | 2555201201 |
7 | 514500163 |
oct | 163154641 |
9 | 62742651 |
10 | 30202273 |
11 | 16059462 |
12 | a146201 |
13 | 634608a |
14 | 4022933 |
15 | 29b8c4d |
hex | 1ccd9a1 |
30202273 has 2 divisors, whose sum is σ = 30202274. Its totient is φ = 30202272.
The previous prime is 30202261. The next prime is 30202303. The reversal of 30202273 is 37220203.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26697889 + 3504384 = 5167^2 + 1872^2 .
It is an emirp because it is prime and its reverse (37220203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30202273 - 25 = 30202241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30202273.
It is not a weakly prime, because it can be changed into another prime (30202213) 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, 15101136 + 15101137.
It is an arithmetic number, because the mean of its divisors is an integer number (15101137).
Almost surely, 230202273 is an apocalyptic number.
It is an amenable number.
30202273 is a deficient number, since it is larger than the sum of its proper divisors (1).
30202273 is an equidigital number, since it uses as much as digits as its factorization.
30202273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 19.
The square root of 30202273 is about 5495.6594690719. The cubic root of 30202273 is about 311.4200305372.
Adding to 30202273 its reverse (37220203), we get a palindrome (67422476).
The spelling of 30202273 in words is "thirty million, two hundred two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •