Base | Representation |
---|---|
bin | 111110110011101… |
… | …011011101100000 |
3 | 2201102210021100001 |
4 | 332303223131200 |
5 | 4124224003002 |
6 | 252321105344 |
7 | 35053411660 |
oct | 7663533540 |
9 | 2642707301 |
10 | 1053734752 |
11 | 4a0895574 |
12 | 254a88254 |
13 | 13a4024b5 |
14 | 9dd381a0 |
15 | 62797a87 |
hex | 3eceb760 |
1053734752 has 48 divisors (see below), whose sum is σ = 2376410400. Its totient is φ = 450551808.
The previous prime is 1053734723. The next prime is 1053734753. The reversal of 1053734752 is 2574373501.
It is a super-2 number, since 2×10537347522 = 2220713855145003008, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053734753) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95338 + ... + 105814.
It is an arithmetic number, because the mean of its divisors is an integer number (49508550).
Almost surely, 21053734752 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 1053734752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1188205200).
1053734752 is an abundant number, since it is smaller than the sum of its proper divisors (1322675648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1053734752 is a wasteful number, since it uses less digits than its factorization.
1053734752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10943 (or 10935 counting only the distinct ones).
The product of its (nonzero) digits is 88200, while the sum is 37.
The square root of 1053734752 is about 32461.2808126851. The cubic root of 1053734752 is about 1017.6000065102.
The spelling of 1053734752 in words is "one billion, fifty-three million, seven hundred thirty-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •