Base | Representation |
---|---|
bin | 111010100001… |
… | …0010100001101 |
3 | 2010201201111122 |
4 | 1311002110031 |
5 | 30323232313 |
6 | 3013330325 |
7 | 521531015 |
oct | 165022415 |
9 | 63651448 |
10 | 30680333 |
11 | 16355652 |
12 | a3369a5 |
13 | 6482858 |
14 | 4108c45 |
15 | 2a60708 |
hex | 1d4250d |
30680333 has 2 divisors, whose sum is σ = 30680334. Its totient is φ = 30680332.
The previous prime is 30680329. The next prime is 30680357. The reversal of 30680333 is 33308603.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29560969 + 1119364 = 5437^2 + 1058^2 .
It is an emirp because it is prime and its reverse (33308603) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30680333 - 22 = 30680329 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30680303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15340166 + 15340167.
It is an arithmetic number, because the mean of its divisors is an integer number (15340167).
Almost surely, 230680333 is an apocalyptic number.
It is an amenable number.
30680333 is a deficient number, since it is larger than the sum of its proper divisors (1).
30680333 is an equidigital number, since it uses as much as digits as its factorization.
30680333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
The square root of 30680333 is about 5538.9830294017. The cubic root of 30680333 is about 313.0545519687.
Adding to 30680333 its reverse (33308603), we get a palindrome (63988936).
It can be divided in two parts, 30680 and 333, that added together give a palindrome (31013).
The spelling of 30680333 in words is "thirty million, six hundred eighty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •