Base | Representation |
---|---|
bin | 111001101100… |
… | …0000111010101 |
3 | 2002220121210112 |
4 | 1303120013111 |
5 | 30220322313 |
6 | 3000132405 |
7 | 515036546 |
oct | 163300725 |
9 | 62817715 |
10 | 30245333 |
11 | 16088848 |
12 | a167105 |
13 | 635c861 |
14 | 40344cd |
15 | 29c68a8 |
hex | 1cd81d5 |
30245333 has 4 divisors (see below), whose sum is σ = 30344160. Its totient is φ = 30146508.
The previous prime is 30245291. The next prime is 30245339. The reversal of 30245333 is 33354203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30245333 - 222 = 26051029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30245299 and 30245308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30245339) 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, 48953 + ... + 49566.
It is an arithmetic number, because the mean of its divisors is an integer number (7586040).
Almost surely, 230245333 is an apocalyptic number.
It is an amenable number.
30245333 is a deficient number, since it is larger than the sum of its proper divisors (98827).
30245333 is an equidigital number, since it uses as much as digits as its factorization.
30245333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98826.
The product of its (nonzero) digits is 3240, while the sum is 23.
The square root of 30245333 is about 5499.5757109072. The cubic root of 30245333 is about 311.5679595657.
Adding to 30245333 its reverse (33354203), we get a palindrome (63599536).
The spelling of 30245333 in words is "thirty million, two hundred forty-five thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •