Base | Representation |
---|---|
bin | 10011101100011010001… |
… | …000001001000101111101 |
3 | 11210101020111111201101001 |
4 | 103230122020021011331 |
5 | 134133131334242003 |
6 | 2513415524250301 |
7 | 166530231015604 |
oct | 23543210110575 |
9 | 4711214451331 |
10 | 1353353040253 |
11 | 481a54566a95 |
12 | 19a357240991 |
13 | 9a80b72a646 |
14 | 49707340a3b |
15 | 2530cd4861d |
hex | 13b1a20917d |
1353353040253 has 2 divisors, whose sum is σ = 1353353040254. Its totient is φ = 1353353040252.
The previous prime is 1353353040241. The next prime is 1353353040287. The reversal of 1353353040253 is 3520403533531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1240857867844 + 112495172409 = 1113938^2 + 335403^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1353353040253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1353353040233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 676676520126 + 676676520127.
It is an arithmetic number, because the mean of its divisors is an integer number (676676520127).
Almost surely, 21353353040253 is an apocalyptic number.
It is an amenable number.
1353353040253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1353353040253 is an equidigital number, since it uses as much as digits as its factorization.
1353353040253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243000, while the sum is 37.
Adding to 1353353040253 its reverse (3520403533531), we get a palindrome (4873756573784).
The spelling of 1353353040253 in words is "one trillion, three hundred fifty-three billion, three hundred fifty-three million, forty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •