Base | Representation |
---|---|
bin | 11110111101111010100… |
… | …00100001010001111000 |
3 | 10202201110020012111110110 |
4 | 33132331100201101320 |
5 | 114413114212142202 |
6 | 2132450513344320 |
7 | 136605465006024 |
oct | 17367520412170 |
9 | 3681406174413 |
10 | 1064032146552 |
11 | 380287453381 |
12 | 1522722680a0 |
13 | 794511c145b |
14 | 396dc61b384 |
15 | 1ca27e8e26c |
hex | f7bd421478 |
1064032146552 has 32 divisors (see below), whose sum is σ = 2661081685200. Its totient is φ = 354543873024.
The previous prime is 1064032146521. The next prime is 1064032146577. The reversal of 1064032146552 is 2556412304601.
It is a super-2 number, since 2×10640321465522 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1064032146552.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8279227 + ... + 8406762.
Almost surely, 21064032146552 is an apocalyptic number.
1064032146552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1064032146552 is an abundant number, since it is smaller than the sum of its proper divisors (1597049538648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1064032146552 is a wasteful number, since it uses less digits than its factorization.
1064032146552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16688655 (or 16688651 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 39.
The spelling of 1064032146552 in words is "one trillion, sixty-four billion, thirty-two million, one hundred forty-six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •