Base | Representation |
---|---|
bin | 1001110000000001011101… |
… | …0000100001010111110000 |
3 | 1101221212211001000222102102 |
4 | 2130000113100201113300 |
5 | 2401121321403442101 |
6 | 34444553324235532 |
7 | 2154353112240065 |
oct | 234002720412760 |
9 | 41855731028372 |
10 | 10720628577776 |
11 | 34636583894a7 |
12 | 125189099bba8 |
13 | 5c9c492934b0 |
14 | 290c49dc0c6c |
15 | 138d0502b86b |
hex | 9c0174215f0 |
10720628577776 has 40 divisors (see below), whose sum is σ = 22377404941920. Its totient is φ = 4946124116736.
The previous prime is 10720628577751. The next prime is 10720628577787. The reversal of 10720628577776 is 67777582602701.
It is a super-2 number, since 2×107206285777762 (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 (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9123431 + ... + 10231238.
It is an arithmetic number, because the mean of its divisors is an integer number (559435123548).
Almost surely, 210720628577776 is an apocalyptic number.
10720628577776 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10720628577776 is an abundant number, since it is smaller than the sum of its proper divisors (11656776364144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10720628577776 is a wasteful number, since it uses less digits than its factorization.
10720628577776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19357353 (or 19357347 counting only the distinct ones).
The product of its (nonzero) digits is 96808320, while the sum is 65.
The spelling of 10720628577776 in words is "ten trillion, seven hundred twenty billion, six hundred twenty-eight million, five hundred seventy-seven thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •