Base | Representation |
---|---|
bin | 11101111001001000000… |
… | …000110010000101110101 |
3 | 21021101020220110210000011 |
4 | 131321020000302011311 |
5 | 232124001322012323 |
6 | 4211404305220221 |
7 | 301261024266226 |
oct | 35711000620565 |
9 | 7241226423004 |
10 | 2054202532213 |
11 | 72220085a557 |
12 | 292150331671 |
13 | 11b930b88540 |
14 | 715d13b524d |
15 | 3867b7a220d |
hex | 1de48032175 |
2054202532213 has 4 divisors (see below), whose sum is σ = 2212218111628. Its totient is φ = 1896186952800.
The previous prime is 2054202532211. The next prime is 2054202532237. The reversal of 2054202532213 is 3122352024502.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 368835153124 + 1685367379089 = 607318^2 + 1298217^2 .
It is a cyclic number.
It is not a de Polignac number, because 2054202532213 - 21 = 2054202532211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2054202532211) 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, 79007789688 + ... + 79007789713.
It is an arithmetic number, because the mean of its divisors is an integer number (553054527907).
Almost surely, 22054202532213 is an apocalyptic number.
It is an amenable number.
2054202532213 is a deficient number, since it is larger than the sum of its proper divisors (158015579415).
2054202532213 is a wasteful number, since it uses less digits than its factorization.
2054202532213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158015579414.
The product of its (nonzero) digits is 28800, while the sum is 31.
Adding to 2054202532213 its reverse (3122352024502), we get a palindrome (5176554556715).
The spelling of 2054202532213 in words is "two trillion, fifty-four billion, two hundred two million, five hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •