Base | Representation |
---|---|
bin | 11110000001110011… |
… | …011100001000111100 |
3 | 10002020000222112202021 |
4 | 132001303130020330 |
5 | 1012013041012130 |
6 | 22451221005524 |
7 | 2220666603643 |
oct | 360163341074 |
9 | 102200875667 |
10 | 32242516540 |
11 | 12746072993 |
12 | 62b9b538a4 |
13 | 306ab61870 |
14 | 17bc1d235a |
15 | c8a94337a |
hex | 781cdc23c |
32242516540 has 48 divisors (see below), whose sum is σ = 77206977792. Its totient is φ = 11204637696.
The previous prime is 32242516531. The next prime is 32242516543. The reversal of 32242516540 is 4561524223.
It is a super-3 number, since 3×322425165403 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a junction number, because it is equal to n+sod(n) for n = 32242516496 and 32242516505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32242516543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3642924 + ... + 3651763.
It is an arithmetic number, because the mean of its divisors is an integer number (1608478704).
Almost surely, 232242516540 is an apocalyptic number.
It is an amenable number.
32242516540 is an abundant number, since it is smaller than the sum of its proper divisors (44964461252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32242516540 is a wasteful number, since it uses less digits than its factorization.
32242516540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7294726 (or 7294724 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 34.
The spelling of 32242516540 in words is "thirty-two billion, two hundred forty-two million, five hundred sixteen thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •