Base | Representation |
---|---|
bin | 110011100100000100010… |
… | …011100111000100110001 |
3 | 110112202012001101012000011 |
4 | 303210010103213010301 |
5 | 431023411042100344 |
6 | 11311454053454521 |
7 | 514001154220516 |
oct | 63440423470461 |
9 | 13482161335004 |
10 | 3543420268849 |
11 | 114683540188a |
12 | 4928a4341441 |
13 | 1c91b2501946 |
14 | c3706a4d30d |
15 | 6228c26bd34 |
hex | 339044e7131 |
3543420268849 has 2 divisors, whose sum is σ = 3543420268850. Its totient is φ = 3543420268848.
The previous prime is 3543420268807. The next prime is 3543420268907. The reversal of 3543420268849 is 9488620243453.
It is an a-pointer prime, because the next prime (3543420268907) can be obtained adding 3543420268849 to its sum of digits (58).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3534614323249 + 8805945600 = 1880057^2 + 93840^2 .
It is a cyclic number.
It is not a de Polignac number, because 3543420268849 - 27 = 3543420268721 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3543420268793 and 3543420268802.
It is not a weakly prime, because it can be changed into another prime (3543420266849) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1771710134424 + 1771710134425.
It is an arithmetic number, because the mean of its divisors is an integer number (1771710134425).
Almost surely, 23543420268849 is an apocalyptic number.
It is an amenable number.
3543420268849 is a deficient number, since it is larger than the sum of its proper divisors (1).
3543420268849 is an equidigital number, since it uses as much as digits as its factorization.
3543420268849 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 39813120, while the sum is 58.
The spelling of 3543420268849 in words is "three trillion, five hundred forty-three billion, four hundred twenty million, two hundred sixty-eight thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •