Base | Representation |
---|---|
bin | 110001001100010101… |
… | …0100101111001001001 |
3 | 101002200021021022012220 |
4 | 1202120222211321021 |
5 | 3212322433022233 |
6 | 120310334524253 |
7 | 10426604403021 |
oct | 1423052457111 |
9 | 332607238186 |
10 | 105640517193 |
11 | 40890355162 |
12 | 18582966689 |
13 | 9c67281c93 |
14 | 5182214a81 |
15 | 2b34513eb3 |
hex | 1898aa5e49 |
105640517193 has 4 divisors (see below), whose sum is σ = 140854022928. Its totient is φ = 70427011460.
The previous prime is 105640517141. The next prime is 105640517197. The reversal of 105640517193 is 391715046501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105640517193 - 225 = 105606962761 is a prime.
It is a super-2 number, since 2×1056405171932 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (105640517197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17606752863 + ... + 17606752868.
It is an arithmetic number, because the mean of its divisors is an integer number (35213505732).
Almost surely, 2105640517193 is an apocalyptic number.
It is an amenable number.
105640517193 is a deficient number, since it is larger than the sum of its proper divisors (35213505735).
105640517193 is an equidigital number, since it uses as much as digits as its factorization.
105640517193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35213505734.
The product of its (nonzero) digits is 113400, while the sum is 42.
The spelling of 105640517193 in words is "one hundred five billion, six hundred forty million, five hundred seventeen thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •