Base | Representation |
---|---|
bin | 11100001111010001… |
… | …100011110000010101 |
3 | 2220021010101000210002 |
4 | 130033101203300111 |
5 | 444044141012323 |
6 | 21532420541045 |
7 | 2122245343553 |
oct | 341721436025 |
9 | 86233330702 |
10 | 30321032213 |
11 | 1194a48330a |
12 | 5a62551785 |
13 | 2b22a480a4 |
14 | 1678d34bd3 |
15 | bc6dde828 |
hex | 70f463c15 |
30321032213 has 2 divisors, whose sum is σ = 30321032214. Its totient is φ = 30321032212.
The previous prime is 30321032179. The next prime is 30321032233. The reversal of 30321032213 is 31223012303.
It is an a-pointer prime, because the next prime (30321032233) can be obtained adding 30321032213 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30106761169 + 214271044 = 173513^2 + 14638^2 .
It is a cyclic number.
It is not a de Polignac number, because 30321032213 - 210 = 30321031189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30321032233) 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, 15160516106 + 15160516107.
It is an arithmetic number, because the mean of its divisors is an integer number (15160516107).
Almost surely, 230321032213 is an apocalyptic number.
It is an amenable number.
30321032213 is a deficient number, since it is larger than the sum of its proper divisors (1).
30321032213 is an equidigital number, since it uses as much as digits as its factorization.
30321032213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30321032213 its reverse (31223012303), we get a palindrome (61544044516).
The spelling of 30321032213 in words is "thirty billion, three hundred twenty-one million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •