Base | Representation |
---|---|
bin | 110001101000111101111… |
… | …100001011100001101101 |
3 | 110002010000101221100111102 |
4 | 301220331330023201231 |
5 | 421342211231002203 |
6 | 11131034204532445 |
7 | 501311533641305 |
oct | 61507574134155 |
9 | 13063011840442 |
10 | 3411243219053 |
11 | 10a5777958a4a |
12 | 471156551125 |
13 | 1b98a95a2987 |
14 | bb16839c605 |
15 | 5db03221888 |
hex | 31a3df0b86d |
3411243219053 has 2 divisors, whose sum is σ = 3411243219054. Its totient is φ = 3411243219052.
The previous prime is 3411243219019. The next prime is 3411243219101. The reversal of 3411243219053 is 3509123421143.
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., 3331274731684 + 79968487369 = 1825178^2 + 282787^2 .
It is a cyclic number.
It is not a de Polignac number, because 3411243219053 - 26 = 3411243218989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3411243218998 and 3411243219016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3411543219053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1705621609526 + 1705621609527.
It is an arithmetic number, because the mean of its divisors is an integer number (1705621609527).
Almost surely, 23411243219053 is an apocalyptic number.
It is an amenable number.
3411243219053 is a deficient number, since it is larger than the sum of its proper divisors (1).
3411243219053 is an equidigital number, since it uses as much as digits as its factorization.
3411243219053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 38.
The spelling of 3411243219053 in words is "three trillion, four hundred eleven billion, two hundred forty-three million, two hundred nineteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •