Base | Representation |
---|---|
bin | 111111011111001… |
… | …100101010110000 |
3 | 2202020020212110021 |
4 | 333133030222300 |
5 | 4140134033320 |
6 | 253405413224 |
7 | 35252365030 |
oct | 7737145260 |
9 | 2666225407 |
10 | 1065142960 |
11 | 4a7277742 |
12 | 25886a214 |
13 | 13c89800b |
14 | a16678c0 |
15 | 6379cdaa |
hex | 3f7ccab0 |
1065142960 has 80 divisors (see below), whose sum is σ = 2876726592. Its totient is φ = 359193600.
The previous prime is 1065142921. The next prime is 1065142979. The reversal of 1065142960 is 692415601.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×10651429602 = 2269059050475123200, which contains 22 as substring.
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, 18570 + ... + 49750.
Almost surely, 21065142960 is an apocalyptic number.
1065142960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1065142960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1438363296).
1065142960 is an abundant number, since it is smaller than the sum of its proper divisors (1811583632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1065142960 is a wasteful number, since it uses less digits than its factorization.
1065142960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31262 (or 31256 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 34.
The square root of 1065142960 is about 32636.5280016119. The cubic root of 1065142960 is about 1021.2591651874.
The spelling of 1065142960 in words is "one billion, sixty-five million, one hundred forty-two thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •