Base | Representation |
---|---|
bin | 111110110001100… |
… | …001010001010000 |
3 | 2201101201111212220 |
4 | 332301201101100 |
5 | 4124102344340 |
6 | 252301021040 |
7 | 35045533512 |
oct | 7661412120 |
9 | 2641644786 |
10 | 1053168720 |
11 | 4a053927a |
12 | 254854780 |
13 | 13a264976 |
14 | 9dc2bbb2 |
15 | 626d4ed0 |
hex | 3ec61450 |
1053168720 has 80 divisors (see below), whose sum is σ = 3268130112. Its totient is φ = 280560640.
The previous prime is 1053168707. The next prime is 1053168733. The reversal of 1053168720 is 278613501.
It is an interprime number because it is at equal distance from previous prime (1053168707) and next prime (1053168733).
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×10531687202 = 2218328705572876800, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 353959 + ... + 356921.
Almost surely, 21053168720 is an apocalyptic number.
1053168720 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1053168720 is an abundant number, since it is smaller than the sum of its proper divisors (2214961392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1053168720 is a wasteful number, since it uses less digits than its factorization.
1053168720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4460 (or 4454 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 33.
The square root of 1053168720 is about 32452.5610699680. The cubic root of 1053168720 is about 1017.4177666781.
The spelling of 1053168720 in words is "one billion, fifty-three million, one hundred sixty-eight thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •