Base | Representation |
---|---|
bin | 1100100001001… |
… | …10110100010001 |
3 | 21022121101200110 |
4 | 12100212310101 |
5 | 203341012333 |
6 | 14230511533 |
7 | 2413424553 |
oct | 620466421 |
9 | 238541613 |
10 | 105016593 |
11 | 54308580 |
12 | 2b2055a9 |
13 | 189abcc6 |
14 | dd394d3 |
15 | 9346063 |
hex | 6426d11 |
105016593 has 8 divisors (see below), whose sum is σ = 152751456. Its totient is φ = 63646400.
The previous prime is 105016589. The next prime is 105016601. The reversal of 105016593 is 395610501.
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 105016593 - 22 = 105016589 is a prime.
It is a super-3 number, since 3×1050165933 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 105016593.
It is not an unprimeable number, because it can be changed into a prime (105016523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1591128 + ... + 1591193.
It is an arithmetic number, because the mean of its divisors is an integer number (19093932).
Almost surely, 2105016593 is an apocalyptic number.
It is an amenable number.
105016593 is a deficient number, since it is larger than the sum of its proper divisors (47734863).
105016593 is a wasteful number, since it uses less digits than its factorization.
105016593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3182335.
The product of its (nonzero) digits is 4050, while the sum is 30.
The square root of 105016593 is about 10247.7603894705. The cubic root of 105016593 is about 471.7942477374.
The spelling of 105016593 in words is "one hundred five million, sixteen thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •