Base | Representation |
---|---|
bin | 100001101010110… |
… | …0000000000000000 |
3 | 2220201202012012010 |
4 | 1003111200000000 |
5 | 4303201201233 |
6 | 304033332520 |
7 | 36665241621 |
oct | 10325400000 |
9 | 2821665163 |
10 | 1129709568 |
11 | 52a767579 |
12 | 276407140 |
13 | 150083700 |
14 | aa073a48 |
15 | 692a3b63 |
hex | 43560000 |
1129709568 has 216 divisors, whose sum is σ = 3453996168. Its totient is φ = 327155712.
The previous prime is 1129709527. The next prime is 1129709599. The reversal of 1129709568 is 8659079211.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 66453496 + ... + 66453512.
It is an arithmetic number, because the mean of its divisors is an integer number (15990723).
Almost surely, 21129709568 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 1129709568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1726998084).
1129709568 is an abundant number, since it is smaller than the sum of its proper divisors (2324286600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1129709568 is an frugal number, since it uses more digits than its factorization.
1129709568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80 (or 35 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 48.
The square root of 1129709568 is about 33611.1524348690. The cubic root of 1129709568 is about 1041.4911941767.
The spelling of 1129709568 in words is "one billion, one hundred twenty-nine million, seven hundred nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •