Base | Representation |
---|---|
bin | 11100001001010000… |
… | …100111010011110101 |
3 | 2220000002111020002002 |
4 | 130021100213103311 |
5 | 443342322340313 |
6 | 21514414025045 |
7 | 2116611536003 |
oct | 341120472365 |
9 | 86002436062 |
10 | 30220121333 |
11 | 118a851a496 |
12 | 5a347a8185 |
13 | 2b07b75acc |
14 | 1669787a73 |
15 | bbd10a058 |
hex | 7094274f5 |
30220121333 has 2 divisors, whose sum is σ = 30220121334. Its totient is φ = 30220121332.
The previous prime is 30220121311. The next prime is 30220121353. The reversal of 30220121333 is 33312102203.
It is an a-pointer prime, because the next prime (30220121353) can be obtained adding 30220121333 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., 29719346449 + 500774884 = 172393^2 + 22378^2 .
It is a cyclic number.
It is not a de Polignac number, because 30220121333 - 222 = 30215927029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30220121353) 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, 15110060666 + 15110060667.
It is an arithmetic number, because the mean of its divisors is an integer number (15110060667).
Almost surely, 230220121333 is an apocalyptic number.
It is an amenable number.
30220121333 is a deficient number, since it is larger than the sum of its proper divisors (1).
30220121333 is an equidigital number, since it uses as much as digits as its factorization.
30220121333 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 30220121333 its reverse (33312102203), we get a palindrome (63532223536).
The spelling of 30220121333 in words is "thirty billion, two hundred twenty million, one hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •