Base | Representation |
---|---|
bin | 110011100001000101001… |
… | …110101100000010101101 |
3 | 110112102220122012210022212 |
4 | 303201011032230002231 |
5 | 431000324404431341 |
6 | 11310204015420205 |
7 | 513525546666665 |
oct | 63410516540255 |
9 | 13472818183285 |
10 | 3540214530221 |
11 | 114543a899a16 |
12 | 49214a824665 |
13 | 1c8ac1304095 |
14 | c34c0dad1a5 |
15 | 62150ad85eb |
hex | 338453ac0ad |
3540214530221 has 2 divisors, whose sum is σ = 3540214530222. Its totient is φ = 3540214530220.
The previous prime is 3540214530211. The next prime is 3540214530311. The reversal of 3540214530221 is 1220354120453.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2851623255625 + 688591274596 = 1688675^2 + 829814^2 .
It is a cyclic number.
It is not a de Polignac number, because 3540214530221 - 218 = 3540214268077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3540214530211) 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, 1770107265110 + 1770107265111.
It is an arithmetic number, because the mean of its divisors is an integer number (1770107265111).
Almost surely, 23540214530221 is an apocalyptic number.
It is an amenable number.
3540214530221 is a deficient number, since it is larger than the sum of its proper divisors (1).
3540214530221 is an equidigital number, since it uses as much as digits as its factorization.
3540214530221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 3540214530221 its reverse (1220354120453), we get a palindrome (4760568650674).
The spelling of 3540214530221 in words is "three trillion, five hundred forty billion, two hundred fourteen million, five hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •