Base | Representation |
---|---|
bin | 110001001100110011… |
… | …0111011000101100011 |
3 | 101002201101000210221022 |
4 | 1202121212323011203 |
5 | 3212341010121033 |
6 | 120312101520055 |
7 | 10430156003141 |
oct | 1423146730543 |
9 | 332641023838 |
10 | 105656332643 |
11 | 40899277584 |
12 | 1858811302b |
13 | 9c6a62b834 |
14 | 5184370591 |
15 | 2b35ada098 |
hex | 18999bb163 |
105656332643 has 8 divisors (see below), whose sum is σ = 108746279376. Its totient is φ = 102590812800.
The previous prime is 105656332591. The next prime is 105656332669. The reversal of 105656332643 is 346233656501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105656332643 - 210 = 105656331619 is a prime.
It is a super-2 number, since 2×1056563326432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105656332594 and 105656332603.
It is not an unprimeable number, because it can be changed into a prime (105656332673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6097946 + ... + 6115247.
It is an arithmetic number, because the mean of its divisors is an integer number (13593284922).
Almost surely, 2105656332643 is an apocalyptic number.
105656332643 is a deficient number, since it is larger than the sum of its proper divisors (3089946733).
105656332643 is a wasteful number, since it uses less digits than its factorization.
105656332643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12213445.
The product of its (nonzero) digits is 1166400, while the sum is 44.
The spelling of 105656332643 in words is "one hundred five billion, six hundred fifty-six million, three hundred thirty-two thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •