Base | Representation |
---|---|
bin | 1001101011010011001011… |
… | …0010110100100101000000 |
3 | 1101200010101002021212011222 |
4 | 2122310302302310211000 |
5 | 2343304131430104202 |
6 | 34343413521054212 |
7 | 2145451246220543 |
oct | 232646262644500 |
9 | 41603332255158 |
10 | 10639486175552 |
11 | 34321a9636753 |
12 | 123a006487368 |
13 | 5c23b7582940 |
14 | 28ad4d62a85a |
15 | 136b565ed4a2 |
hex | 9ad32cb4940 |
10639486175552 has 56 divisors (see below), whose sum is σ = 23933459575200. Its totient is φ = 4652083017216.
The previous prime is 10639486175471. The next prime is 10639486175567. The reversal of 10639486175552 is 25557168493601.
It is a super-2 number, since 2×106394861755522 (a number of 27 digits) 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 (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 336506402 + ... + 336538017.
It is an arithmetic number, because the mean of its divisors is an integer number (427383206700).
It is a 1-persistent number, because it is pandigital, but 2⋅10639486175552 = 21278972351104 is not.
Almost surely, 210639486175552 is an apocalyptic number.
It is an amenable number.
10639486175552 is an abundant number, since it is smaller than the sum of its proper divisors (13293973399648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10639486175552 is a wasteful number, since it uses less digits than its factorization.
10639486175552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673044463 (or 673044453 counting only the distinct ones).
The product of its (nonzero) digits is 54432000, while the sum is 62.
The spelling of 10639486175552 in words is "ten trillion, six hundred thirty-nine billion, four hundred eighty-six million, one hundred seventy-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •