Base | Representation |
---|---|
bin | 1010010001110011001… |
… | …01101111001011001101 |
3 | 1020202112212122012202221 |
4 | 11020321211233023031 |
5 | 21241224244342031 |
6 | 430123025215341 |
7 | 34341321216133 |
oct | 5107145571315 |
9 | 1222485565687 |
10 | 353153512141 |
11 | 126853a50731 |
12 | 5853a491551 |
13 | 273c1011541 |
14 | 131425d9753 |
15 | 92bdd1ca11 |
hex | 523996f2cd |
353153512141 has 2 divisors, whose sum is σ = 353153512142. Its totient is φ = 353153512140.
The previous prime is 353153512139. The next prime is 353153512163. The reversal of 353153512141 is 141215351353.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 311464448100 + 41689064041 = 558090^2 + 204179^2 .
It is a cyclic number.
It is not a de Polignac number, because 353153512141 - 21 = 353153512139 is a prime.
Together with 353153512139, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 353153512097 and 353153512106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (353153512441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 176576756070 + 176576756071.
It is an arithmetic number, because the mean of its divisors is an integer number (176576756071).
Almost surely, 2353153512141 is an apocalyptic number.
It is an amenable number.
353153512141 is a deficient number, since it is larger than the sum of its proper divisors (1).
353153512141 is an equidigital number, since it uses as much as digits as its factorization.
353153512141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27000, while the sum is 34.
Adding to 353153512141 its reverse (141215351353), we get a palindrome (494368863494).
The spelling of 353153512141 in words is "three hundred fifty-three billion, one hundred fifty-three million, five hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •