Base | Representation |
---|---|
bin | 110011010111111110110… |
… | …000001111101101010101 |
3 | 110111111200120212111022211 |
4 | 303113332300033231111 |
5 | 430320321201211013 |
6 | 11301510204553421 |
7 | 513031435435606 |
oct | 63277660175525 |
9 | 13444616774284 |
10 | 3530442210133 |
11 | 1141285653223 |
12 | 490281b52871 |
13 | 1c7bc4842b67 |
14 | c2c35195dad |
15 | 61c7cc0123d |
hex | 335fec0fb55 |
3530442210133 has 2 divisors, whose sum is σ = 3530442210134. Its totient is φ = 3530442210132.
The previous prime is 3530442210109. The next prime is 3530442210199. The reversal of 3530442210133 is 3310122440353.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3059987515524 + 470454694609 = 1749282^2 + 685897^2 .
It is a cyclic number.
It is not a de Polignac number, because 3530442210133 - 217 = 3530442079061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3530442210095 and 3530442210104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3530442210833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1765221105066 + 1765221105067.
It is an arithmetic number, because the mean of its divisors is an integer number (1765221105067).
Almost surely, 23530442210133 is an apocalyptic number.
It is an amenable number.
3530442210133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3530442210133 is an equidigital number, since it uses as much as digits as its factorization.
3530442210133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 3530442210133 its reverse (3310122440353), we get a palindrome (6840564650486).
The spelling of 3530442210133 in words is "three trillion, five hundred thirty billion, four hundred forty-two million, two hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •