Base | Representation |
---|---|
bin | 1001101111011110111000… |
… | …0100111110100010011100 |
3 | 1101220222212020112010120220 |
4 | 2123313232010332202130 |
5 | 2400443320011013233 |
6 | 34440420352041340 |
7 | 2153604116433216 |
oct | 233675604764234 |
9 | 41828766463526 |
10 | 10711347751068 |
11 | 345a725619a88 |
12 | 124bb20833250 |
13 | 5c90ca599463 |
14 | 2906095875b6 |
15 | 13896037beb3 |
hex | 9bdee13e89c |
10711347751068 has 24 divisors (see below), whose sum is σ = 25668635152272. Its totient is φ = 3473950621824.
The previous prime is 10711347751061. The next prime is 10711347751121. The reversal of 10711347751068 is 86015774311701.
It is a happy number.
It is a super-2 number, since 2×107113477510682 (a number of 27 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 10711347751068.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10711347751061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12062328105 + ... + 12062328992.
It is an arithmetic number, because the mean of its divisors is an integer number (1069526464678).
Almost surely, 210711347751068 is an apocalyptic number.
It is an amenable number.
10711347751068 is an abundant number, since it is smaller than the sum of its proper divisors (14957287401204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10711347751068 is a wasteful number, since it uses less digits than its factorization.
10711347751068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24124657141 (or 24124657139 counting only the distinct ones).
The product of its (nonzero) digits is 987840, while the sum is 51.
The spelling of 10711347751068 in words is "ten trillion, seven hundred eleven billion, three hundred forty-seven million, seven hundred fifty-one thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •