Base | Representation |
---|---|
bin | 10011101100011001100… |
… | …100110000001011000101 |
3 | 11210101012212001101120022 |
4 | 103230121210300023011 |
5 | 134133122000410031 |
6 | 2513414553344525 |
7 | 166530056116616 |
oct | 23543144601305 |
9 | 4711185041508 |
10 | 1353343763141 |
11 | 481a4a2aaa57 |
12 | 19a354108145 |
13 | 9a80982cb26 |
14 | 49706007c0d |
15 | 2530c11497b |
hex | 13b199302c5 |
1353343763141 has 2 divisors, whose sum is σ = 1353343763142. Its totient is φ = 1353343763140.
The previous prime is 1353343763129. The next prime is 1353343763179. The reversal of 1353343763141 is 1413673433531.
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., 963410956225 + 389932806916 = 981535^2 + 624446^2 .
It is a cyclic number.
It is not a de Polignac number, because 1353343763141 - 210 = 1353343762117 is a prime.
It is a super-2 number, since 2×13533437631412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1353343763092 and 1353343763101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1353343793141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 676671881570 + 676671881571.
It is an arithmetic number, because the mean of its divisors is an integer number (676671881571).
Almost surely, 21353343763141 is an apocalyptic number.
It is an amenable number.
1353343763141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1353343763141 is an equidigital number, since it uses as much as digits as its factorization.
1353343763141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 816480, while the sum is 44.
The spelling of 1353343763141 in words is "one trillion, three hundred fifty-three billion, three hundred forty-three million, seven hundred sixty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •