Base | Representation |
---|---|
bin | 1001101001111110100010… |
… | …1010110000101101110000 |
3 | 1101120221201210111100011010 |
4 | 2122133220222300231300 |
5 | 2342421120013241422 |
6 | 34325135321350520 |
7 | 2144015254401342 |
oct | 232375052605560 |
9 | 41527653440133 |
10 | 10616767712112 |
11 | 342360065a931 |
12 | 1235726038440 |
13 | 5c0206928673 |
14 | 289bd62a7292 |
15 | 136276da1b0c |
hex | 9a7e8ab0b70 |
10616767712112 has 40 divisors (see below), whose sum is σ = 27427734262656. Its totient is φ = 3538782655936.
The previous prime is 10616767712099. The next prime is 10616767712123. The reversal of 10616767712112 is 21121776761601.
10616767712112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×106167677121122 (a number of 27 digits) contains 22 as substring.
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 polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3142038 + ... + 5577269.
Almost surely, 210616767712112 is an apocalyptic number.
10616767712112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10616767712112 is an abundant number, since it is smaller than the sum of its proper divisors (16810966550544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10616767712112 is a wasteful number, since it uses less digits than its factorization.
10616767712112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8744685 (or 8744679 counting only the distinct ones).
The product of its (nonzero) digits is 296352, while the sum is 48.
The spelling of 10616767712112 in words is "ten trillion, six hundred sixteen billion, seven hundred sixty-seven million, seven hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •