Base | Representation |
---|---|
bin | 11101110110100000… |
… | …111100111000001101 |
3 | 10001201211121020021001 |
4 | 131312200330320031 |
5 | 1011121044324100 |
6 | 22420333340301 |
7 | 2213210012656 |
oct | 356640747015 |
9 | 101654536231 |
10 | 32053120525 |
11 | 12659172958 |
12 | 6266637691 |
13 | 303a84b00a |
14 | 17a0db052d |
15 | c78ed0d6a |
hex | 77683ce0d |
32053120525 has 24 divisors (see below), whose sum is σ = 40393664640. Its totient is φ = 25227162240.
The previous prime is 32053120523. The next prime is 32053120549. The reversal of 32053120525 is 52502135023.
It is not a de Polignac number, because 32053120525 - 21 = 32053120523 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32053120493 and 32053120502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32053120523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 463609 + ... + 528241.
It is an arithmetic number, because the mean of its divisors is an integer number (1683069360).
Almost surely, 232053120525 is an apocalyptic number.
It is an amenable number.
32053120525 is a deficient number, since it is larger than the sum of its proper divisors (8340544115).
32053120525 is a wasteful number, since it uses less digits than its factorization.
32053120525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64965 (or 64960 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 28.
Adding to 32053120525 its reverse (52502135023), we get a palindrome (84555255548).
It can be divided in two parts, 320531 and 20525, that added together give a square (341056 = 5842).
The spelling of 32053120525 in words is "thirty-two billion, fifty-three million, one hundred twenty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •