Base | Representation |
---|---|
bin | 111110011010101… |
… | …111010000100000 |
3 | 2200222111002211010 |
4 | 332122233100200 |
5 | 4121040243304 |
6 | 251525020520 |
7 | 34644011421 |
oct | 7632572040 |
9 | 2628432733 |
10 | 1047196704 |
11 | 49812a424 |
12 | 252854740 |
13 | 138c53628 |
14 | 9d115648 |
15 | 61e05789 |
hex | 3e6af420 |
1047196704 has 96 divisors (see below), whose sum is σ = 2901528000. Its totient is φ = 329785344.
The previous prime is 1047196691. The next prime is 1047196721. The reversal of 1047196704 is 4076917401.
1047196704 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (96).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1037352 + ... + 1038360.
It is an arithmetic number, because the mean of its divisors is an integer number (30224250).
Almost surely, 21047196704 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1047196704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1450764000).
1047196704 is an abundant number, since it is smaller than the sum of its proper divisors (1854331296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1047196704 is a wasteful number, since it uses less digits than its factorization.
1047196704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1610 (or 1602 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 39.
The square root of 1047196704 is about 32360.4187859181. The cubic root of 1047196704 is about 1015.4910237146.
The spelling of 1047196704 in words is "one billion, forty-seven million, one hundred ninety-six thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •