Base | Representation |
---|---|
bin | 110000000111011101001… |
… | …010110101100001110101 |
3 | 102201002202111012220012022 |
4 | 300013131022311201311 |
5 | 413133243324043203 |
6 | 11011000445202525 |
7 | 460614104066432 |
oct | 60073512654165 |
9 | 12632674186168 |
10 | 3306540456053 |
11 | 106532898245a |
12 | 4549b5860445 |
13 | 1aca616a5943 |
14 | b6074930b89 |
15 | 5b0261e5a38 |
hex | 301dd2b5875 |
3306540456053 has 2 divisors, whose sum is σ = 3306540456054. Its totient is φ = 3306540456052.
The previous prime is 3306540456047. The next prime is 3306540456113. The reversal of 3306540456053 is 3506540456033.
3306540456053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2442787695364 + 863752760689 = 1562942^2 + 929383^2 .
It is a cyclic number.
It is not a de Polignac number, because 3306540456053 - 28 = 3306540455797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3306540455995 and 3306540456013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3306540452053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1653270228026 + 1653270228027.
It is an arithmetic number, because the mean of its divisors is an integer number (1653270228027).
Almost surely, 23306540456053 is an apocalyptic number.
It is an amenable number.
3306540456053 is a deficient number, since it is larger than the sum of its proper divisors (1).
3306540456053 is an equidigital number, since it uses as much as digits as its factorization.
3306540456053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944000, while the sum is 44.
The spelling of 3306540456053 in words is "three trillion, three hundred six billion, five hundred forty million, four hundred fifty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •