Base | Representation |
---|---|
bin | 1100100110101… |
… | …01001100101001 |
3 | 21100221200110200 |
4 | 12103111030221 |
5 | 204031341412 |
6 | 14254102413 |
7 | 2422461141 |
oct | 623251451 |
9 | 240850420 |
10 | 105730857 |
11 | 54756181 |
12 | 2b4aaa09 |
13 | 18b9c14b |
14 | 10083921 |
15 | 94379dc |
hex | 64d5329 |
105730857 has 12 divisors (see below), whose sum is σ = 154874304. Its totient is φ = 69494040.
The previous prime is 105730831. The next prime is 105730861. The reversal of 105730857 is 758037501.
105730857 is a `hidden beast` number, since 1 + 0 + 573 + 0 + 85 + 7 = 666.
It is not a de Polignac number, because 105730857 - 214 = 105714473 is a prime.
It is a super-2 number, since 2×1057308572 = 22358028243908898, which contains 22 as substring.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (105730657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 82093 + ... + 83370.
It is an arithmetic number, because the mean of its divisors is an integer number (12906192).
Almost surely, 2105730857 is an apocalyptic number.
It is an amenable number.
105730857 is a deficient number, since it is larger than the sum of its proper divisors (49143447).
105730857 is a wasteful number, since it uses less digits than its factorization.
105730857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165540 (or 165537 counting only the distinct ones).
The product of its (nonzero) digits is 29400, while the sum is 36.
The square root of 105730857 is about 10282.5510939650. The cubic root of 105730857 is about 472.8614585305.
The spelling of 105730857 in words is "one hundred five million, seven hundred thirty thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •