Base | Representation |
---|---|
bin | 111010001011… |
… | …1100100100101 |
3 | 2010101211100012 |
4 | 1310113210211 |
5 | 30302132003 |
6 | 3005500005 |
7 | 520201412 |
oct | 164274445 |
9 | 63354305 |
10 | 30505253 |
11 | 16246059 |
12 | a271605 |
13 | 6420c5c |
14 | 40a1109 |
15 | 2a288d8 |
hex | 1d17925 |
30505253 has 4 divisors (see below), whose sum is σ = 30660300. Its totient is φ = 30350208.
The previous prime is 30505249. The next prime is 30505309. The reversal of 30505253 is 35250503.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30052324 + 452929 = 5482^2 + 673^2 .
It is a cyclic number.
It is not a de Polignac number, because 30505253 - 22 = 30505249 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30505213) 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 in 3 ways as a sum of consecutive naturals, for example, 77228 + ... + 77621.
It is an arithmetic number, because the mean of its divisors is an integer number (7665075).
Almost surely, 230505253 is an apocalyptic number.
It is an amenable number.
30505253 is a deficient number, since it is larger than the sum of its proper divisors (155047).
30505253 is a wasteful number, since it uses less digits than its factorization.
30505253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155046.
The product of its (nonzero) digits is 2250, while the sum is 23.
The square root of 30505253 is about 5523.1560723919. The cubic root of 30505253 is about 312.4579245752.
Adding to 30505253 its reverse (35250503), we get a palindrome (65755756).
The spelling of 30505253 in words is "thirty million, five hundred five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •