Base | Representation |
---|---|
bin | 101100011011110100101… |
… | …001001000101110100001 |
3 | 101210220200211200020000022 |
4 | 230123310221020232201 |
5 | 400012112442021023 |
6 | 10254434535003225 |
7 | 433416230662526 |
oct | 54336451105641 |
9 | 11726624606008 |
10 | 3053531204513 |
11 | a77aa4839a69 |
12 | 413965509515 |
13 | 191c4004354a |
14 | a7b125c914d |
15 | 5466910b7c8 |
hex | 2c6f4a48ba1 |
3053531204513 has 2 divisors, whose sum is σ = 3053531204514. Its totient is φ = 3053531204512.
The previous prime is 3053531204501. The next prime is 3053531204531. The reversal of 3053531204513 is 3154021353503.
It is a happy number.
Together with next prime (3053531204531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1675696593169 + 1377834611344 = 1294487^2 + 1173812^2 .
It is a cyclic number.
It is not a de Polignac number, because 3053531204513 - 28 = 3053531204257 is a prime.
It is a super-2 number, since 2×30535312045132 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3053531204573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1526765602256 + 1526765602257.
It is an arithmetic number, because the mean of its divisors is an integer number (1526765602257).
Almost surely, 23053531204513 is an apocalyptic number.
It is an amenable number.
3053531204513 is a deficient number, since it is larger than the sum of its proper divisors (1).
3053531204513 is an equidigital number, since it uses as much as digits as its factorization.
3053531204513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81000, while the sum is 35.
The spelling of 3053531204513 in words is "three trillion, fifty-three billion, five hundred thirty-one million, two hundred four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •