Base | Representation |
---|---|
bin | 111111011101110… |
… | …001011010000000 |
3 | 2202012112212200112 |
4 | 333131301122000 |
5 | 4140040103102 |
6 | 253353410452 |
7 | 35246250146 |
oct | 7735613200 |
9 | 2665485615 |
10 | 1064769152 |
11 | 4a7041907 |
12 | 258709a28 |
13 | 13c796b25 |
14 | a15ab596 |
15 | 63727252 |
hex | 3f771680 |
1064769152 has 128 divisors (see below), whose sum is σ = 2294853120. Its totient is φ = 491212800.
The previous prime is 1064769137. The next prime is 1064769197. The reversal of 1064769152 is 2519674601.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×10647691522 = 2267466694101598208, 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, 12828503 + ... + 12828585.
It is an arithmetic number, because the mean of its divisors is an integer number (17928540).
Almost surely, 21064769152 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 1064769152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1147426560).
1064769152 is an abundant number, since it is smaller than the sum of its proper divisors (1230083968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1064769152 is an equidigital number, since it uses as much as digits as its factorization.
1064769152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 242 (or 230 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 41.
The square root of 1064769152 is about 32630.8006644029. The cubic root of 1064769152 is about 1021.1396821610.
The spelling of 1064769152 in words is "one billion, sixty-four million, seven hundred sixty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •