Base | Representation |
---|---|
bin | 11110100000001110… |
… | …110011000111111010 |
3 | 10010112121120001100010 |
4 | 132200032303013322 |
5 | 1014034232130200 |
6 | 23014014322350 |
7 | 2236435643433 |
oct | 364016630772 |
9 | 103477501303 |
10 | 32753005050 |
11 | 12988243517 |
12 | 6420ab93b6 |
13 | 311c84997c |
14 | 1829d1848a |
15 | cba67e150 |
hex | 7a03b31fa |
32753005050 has 48 divisors (see below), whose sum is σ = 83847704832. Its totient is φ = 8452387200.
The previous prime is 32753004989. The next prime is 32753005063. The reversal of 32753005050 is 5050035723.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 32753004999 and 32753005017.
It is an unprimeable number.
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, 3517179 + ... + 3526478.
It is an arithmetic number, because the mean of its divisors is an integer number (1746827184).
Almost surely, 232753005050 is an apocalyptic number.
32753005050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
32753005050 is an abundant number, since it is smaller than the sum of its proper divisors (51094699782).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32753005050 is a wasteful number, since it uses less digits than its factorization.
32753005050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7043703 (or 7043698 counting only the distinct ones).
The product of its (nonzero) digits is 15750, while the sum is 30.
The spelling of 32753005050 in words is "thirty-two billion, seven hundred fifty-three million, five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •