Base | Representation |
---|---|
bin | 11101110111011110100… |
… | …000101110011110101101 |
3 | 21021012200112212220021020 |
4 | 131313132200232132231 |
5 | 232111340211134013 |
6 | 4210512515524353 |
7 | 301166122403121 |
oct | 35673640563655 |
9 | 7235615786236 |
10 | 2052432521133 |
11 | 721482718a85 |
12 | 2919375b96b9 |
13 | 11b70b2683c7 |
14 | 714a42a7581 |
15 | 385c61be623 |
hex | 1ddde82e7ad |
2052432521133 has 16 divisors (see below), whose sum is σ = 2856323598720. Its totient is φ = 1308446783424.
The previous prime is 2052432521131. The next prime is 2052432521201. The reversal of 2052432521133 is 3311252342502.
It is not a de Polignac number, because 2052432521133 - 21 = 2052432521131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2052432521094 and 2052432521103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2052432521131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3726538 + ... + 4241691.
It is an arithmetic number, because the mean of its divisors is an integer number (178520224920).
Almost surely, 22052432521133 is an apocalyptic number.
2052432521133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2052432521133 is a deficient number, since it is larger than the sum of its proper divisors (803891077587).
2052432521133 is a wasteful number, since it uses less digits than its factorization.
2052432521133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7971988.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 2052432521133 its reverse (3311252342502), we get a palindrome (5363684863635).
The spelling of 2052432521133 in words is "two trillion, fifty-two billion, four hundred thirty-two million, five hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •