Base | Representation |
---|---|
bin | 11110011101011011… |
… | …101010111111001100 |
3 | 10010102100012101022012 |
4 | 132131123222333030 |
5 | 1013440222013243 |
6 | 23005220040352 |
7 | 2235325551320 |
oct | 363533527714 |
9 | 103370171265 |
10 | 32706047948 |
11 | 129637909a2 |
12 | 64092330b8 |
13 | 3112bb85c2 |
14 | 18239b3980 |
15 | cb64a5d18 |
hex | 79d6eafcc |
32706047948 has 12 divisors (see below), whose sum is σ = 65412095952. Its totient is φ = 14016877680.
The previous prime is 32706047947. The next prime is 32706047977. The reversal of 32706047948 is 84974060723.
32706047948 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 32706047896 and 32706047905.
It is not an unprimeable number, because it can be changed into a prime (32706047947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 584036543 + ... + 584036598.
It is an arithmetic number, because the mean of its divisors is an integer number (5451007996).
Almost surely, 232706047948 is an apocalyptic number.
It is an amenable number.
32706047948 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32706047948 is a wasteful number, since it uses less digits than its factorization.
32706047948 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1168073152 (or 1168073150 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 50.
The spelling of 32706047948 in words is "thirty-two billion, seven hundred six million, forty-seven thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •