Base | Representation |
---|---|
bin | 110000001101010000000… |
… | …110000001101000100101 |
3 | 102201200211012001102022222 |
4 | 300031100012001220211 |
5 | 413234014431321203 |
6 | 11013510151402125 |
7 | 461224240333340 |
oct | 60152006015045 |
9 | 12650735042288 |
10 | 3312763542053 |
11 | 1067a31724039 |
12 | 456051983345 |
13 | 1b0513a4c954 |
14 | b64a5211457 |
15 | 5b28c6e8038 |
hex | 30350181a25 |
3312763542053 has 4 divisors (see below), whose sum is σ = 3786015476640. Its totient is φ = 2839511607468.
The previous prime is 3312763542031. The next prime is 3312763542073. The reversal of 3312763542053 is 3502453672133.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3312763542053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3312763541995 and 3312763542013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3312763542073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 236625967283 + ... + 236625967296.
It is an arithmetic number, because the mean of its divisors is an integer number (946503869160).
Almost surely, 23312763542053 is an apocalyptic number.
It is an amenable number.
3312763542053 is a deficient number, since it is larger than the sum of its proper divisors (473251934587).
3312763542053 is an equidigital number, since it uses as much as digits as its factorization.
3312763542053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 473251934586.
The product of its (nonzero) digits is 1360800, while the sum is 44.
The spelling of 3312763542053 in words is "three trillion, three hundred twelve billion, seven hundred sixty-three million, five hundred forty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •