Base | Representation |
---|---|
bin | 11110110100111010… |
… | …100110000100000101 |
3 | 10011102210112202100221 |
4 | 132310322212010011 |
5 | 1020242101431323 |
6 | 23112252304341 |
7 | 2251151420545 |
oct | 366472460405 |
9 | 104383482327 |
10 | 33100030213 |
11 | 13046116678 |
12 | 64b91720b1 |
13 | 3176700ac3 |
14 | 186004d325 |
15 | cdad7b55d |
hex | 7b4ea6105 |
33100030213 has 2 divisors, whose sum is σ = 33100030214. Its totient is φ = 33100030212.
The previous prime is 33100030211. The next prime is 33100030289. The reversal of 33100030213 is 31203000133.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19032409764 + 14067620449 = 137958^2 + 118607^2 .
It is a cyclic number.
It is not a de Polignac number, because 33100030213 - 21 = 33100030211 is a prime.
It is a super-2 number, since 2×331000302132 (a number of 22 digits) contains 22 as substring.
Together with 33100030211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33100030211) 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, 16550015106 + 16550015107.
It is an arithmetic number, because the mean of its divisors is an integer number (16550015107).
Almost surely, 233100030213 is an apocalyptic number.
It is an amenable number.
33100030213 is a deficient number, since it is larger than the sum of its proper divisors (1).
33100030213 is an equidigital number, since it uses as much as digits as its factorization.
33100030213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 33100030213 its reverse (31203000133), we get a palindrome (64303030346).
The spelling of 33100030213 in words is "thirty-three billion, one hundred million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •