Base | Representation |
---|---|
bin | 11110110100111011… |
… | …101111010000011101 |
3 | 10011102211002222121122 |
4 | 132310323233100131 |
5 | 1020242141030023 |
6 | 23112302540325 |
7 | 2251154106602 |
oct | 366473572035 |
9 | 104384088548 |
10 | 33100330013 |
11 | 13046300943 |
12 | 64b92976a5 |
13 | 31767a73ba |
14 | 18600ca6a9 |
15 | cdadda2c8 |
hex | 7b4eef41d |
33100330013 has 2 divisors, whose sum is σ = 33100330014. Its totient is φ = 33100330012.
The previous prime is 33100329991. The next prime is 33100330033. The reversal of 33100330013 is 31003300133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32724086404 + 376243609 = 180898^2 + 19397^2 .
It is a cyclic number.
It is not a de Polignac number, because 33100330013 - 212 = 33100325917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 33100329973 and 33100330000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33100330033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16550165006 + 16550165007.
It is an arithmetic number, because the mean of its divisors is an integer number (16550165007).
Almost surely, 233100330013 is an apocalyptic number.
It is an amenable number.
33100330013 is a deficient number, since it is larger than the sum of its proper divisors (1).
33100330013 is an equidigital number, since it uses as much as digits as its factorization.
33100330013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243, while the sum is 17.
Adding to 33100330013 its reverse (31003300133), we get a palindrome (64103630146).
It can be divided in two parts, 3 and 3100330013, that multiplied together give a palindrome (9300990039).
The spelling of 33100330013 in words is "thirty-three billion, one hundred million, three hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •