Base | Representation |
---|---|
bin | 10111111000110101111110… |
… | …001010010101100101100110 |
3 | 111202222202121110011000200010 |
4 | 113320311332022111211212 |
5 | 102232311031241312114 |
6 | 1011240300021031050 |
7 | 31062300146362656 |
oct | 2770657612254546 |
9 | 452882543130603 |
10 | 105061311666534 |
11 | 30526285547223 |
12 | b949704855486 |
13 | 4681315628622 |
14 | 1bd2dcd328366 |
15 | c22d4498ac59 |
hex | 5f8d7e295966 |
105061311666534 has 8 divisors (see below), whose sum is σ = 210122623333080. Its totient is φ = 35020437222176.
The previous prime is 105061311666533. The next prime is 105061311666667. The reversal of 105061311666534 is 435666113160501.
It is a sphenic number, since it is the product of 3 distinct primes.
105061311666534 is an admirable number.
It is a super-2 number, since 2×1050613116665342 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105061311666533) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8755109305539 + ... + 8755109305550.
It is an arithmetic number, because the mean of its divisors is an integer number (26265327916635).
Almost surely, 2105061311666534 is an apocalyptic number.
105061311666534 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105061311666534 is a wasteful number, since it uses less digits than its factorization.
105061311666534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17510218611094.
The product of its (nonzero) digits is 1166400, while the sum is 48.
The spelling of 105061311666534 in words is "one hundred five trillion, sixty-one billion, three hundred eleven million, six hundred sixty-six thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •