Base | Representation |
---|---|
bin | 111110110001010… |
… | …111100000101011 |
3 | 2201101122111001102 |
4 | 332301113200223 |
5 | 4124100104442 |
6 | 252300112015 |
7 | 35045306126 |
oct | 7661274053 |
9 | 2641574042 |
10 | 1053128747 |
11 | 4a0511240 |
12 | 25483560b |
13 | 13a24c708 |
14 | 9dc1b3bd |
15 | 626c8232 |
hex | 3ec5782b |
1053128747 has 8 divisors (see below), whose sum is σ = 1176889392. Its totient is φ = 934038400.
The previous prime is 1053128737. The next prime is 1053128759. The reversal of 1053128747 is 7478213501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1053128747 - 24 = 1053128731 is a prime.
It is a super-2 number, since 2×10531287472 = 2218160315515580018, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1053128747.
It is not an unprimeable number, because it can be changed into a prime (1053128737) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1167098 + ... + 1167999.
It is an arithmetic number, because the mean of its divisors is an integer number (147111174).
Almost surely, 21053128747 is an apocalyptic number.
1053128747 is a deficient number, since it is larger than the sum of its proper divisors (123760645).
1053128747 is a wasteful number, since it uses less digits than its factorization.
1053128747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2335149.
The product of its (nonzero) digits is 47040, while the sum is 38.
The square root of 1053128747 is about 32451.9451959355. The cubic root of 1053128747 is about 1017.4048944908.
The spelling of 1053128747 in words is "one billion, fifty-three million, one hundred twenty-eight thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •