Base | Representation |
---|---|
bin | 11110101110011000… |
… | …101001011001000010 |
3 | 10011011011101101210020 |
4 | 132232120221121002 |
5 | 1020031024431100 |
6 | 23053340114310 |
7 | 2245351230300 |
oct | 365630513102 |
9 | 104134341706 |
10 | 32990467650 |
11 | 12a9a2936a8 |
12 | 6488535996 |
13 | 3159abc89a |
14 | 184d68d270 |
15 | cd14385a0 |
hex | 7ae629642 |
32990467650 has 72 divisors (see below), whose sum is σ = 95174154000. Its totient is φ = 7540676640.
The previous prime is 32990467639. The next prime is 32990467663. The reversal of 32990467650 is 5676409923.
It is a junction number, because it is equal to n+sod(n) for n = 32990467593 and 32990467602.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 2236900 + ... + 2251599.
It is an arithmetic number, because the mean of its divisors is an integer number (1321863250).
Almost surely, 232990467650 is an apocalyptic number.
32990467650 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
32990467650 is an abundant number, since it is smaller than the sum of its proper divisors (62183686350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32990467650 is a wasteful number, since it uses less digits than its factorization.
32990467650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4488528 (or 4488516 counting only the distinct ones).
The product of its (nonzero) digits is 2449440, while the sum is 51.
The spelling of 32990467650 in words is "thirty-two billion, nine hundred ninety million, four hundred sixty-seven thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •