Base | Representation |
---|---|
bin | 111110011011101… |
… | …110111000100000 |
3 | 2200222222100022021 |
4 | 332123232320200 |
5 | 4121122113222 |
6 | 251534351224 |
7 | 34646145256 |
oct | 7633567040 |
9 | 2628870267 |
10 | 1047457312 |
11 | 498298200 |
12 | 25295b514 |
13 | 139015135 |
14 | 9d1825d6 |
15 | 61e57ac7 |
hex | 3e6eee20 |
1047457312 has 72 divisors (see below), whose sum is σ = 2400181308. Its totient is φ = 448081920.
The previous prime is 1047457303. The next prime is 1047457331. The reversal of 1047457312 is 2137547401.
It can be written as a sum of positive squares in 2 ways, for example, as 945931536 + 101525776 = 30756^2 + 10076^2 .
It is a Harshad number since it is a multiple of its sum of digits (34).
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 11 ways as a sum of consecutive naturals, for example, 57868 + ... + 73780.
Almost surely, 21047457312 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 1047457312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1200090654).
1047457312 is an abundant number, since it is smaller than the sum of its proper divisors (1352723996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1047457312 is a wasteful number, since it uses less digits than its factorization.
1047457312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15962 (or 15943 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 34.
The square root of 1047457312 is about 32364.4451829473. The cubic root of 1047457312 is about 1015.5752559425.
The spelling of 1047457312 in words is "one billion, forty-seven million, four hundred fifty-seven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •