Base | Representation |
---|---|
bin | 11000010001110111110011… |
… | …010111111000101111010000 |
3 | 112000002012002221220211011101 |
4 | 120101313303113320233100 |
5 | 102444001012324233211 |
6 | 1015034345211354144 |
7 | 31330456202164402 |
oct | 3021676327705720 |
9 | 460065087824141 |
10 | 106781265071056 |
11 | 31029753394974 |
12 | bb86b11752954 |
13 | 4777578ba3124 |
14 | 1c52352aacb72 |
15 | c5295bdbe5c1 |
hex | 611df35f8bd0 |
106781265071056 has 40 divisors (see below), whose sum is σ = 214872729876224. Its totient is φ = 51351370260480.
The previous prime is 106781265071051. The next prime is 106781265071069. The reversal of 106781265071056 is 650170562187601.
It is a super-2 number, since 2×1067812650710562 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106781265070988 and 106781265071006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106781265071051) 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, 660302001 + ... + 660463696.
Almost surely, 2106781265071056 is an apocalyptic number.
106781265071056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
106781265071056 is an abundant number, since it is smaller than the sum of its proper divisors (108091464805168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106781265071056 is a wasteful number, since it uses less digits than its factorization.
106781265071056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1320765899 (or 1320765893 counting only the distinct ones).
The product of its (nonzero) digits is 4233600, while the sum is 55.
The spelling of 106781265071056 in words is "one hundred six trillion, seven hundred eighty-one billion, two hundred sixty-five million, seventy-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •