Base | Representation |
---|---|
bin | 1100100001001… |
… | …11100111010001 |
3 | 21022121120011100 |
4 | 12100213213101 |
5 | 203341113412 |
6 | 14230535013 |
7 | 2413440225 |
oct | 620474721 |
9 | 238546140 |
10 | 105019857 |
11 | 5430aa78 |
12 | 2b207469 |
13 | 189b0637 |
14 | dd3a785 |
15 | 9346edc |
hex | 64279d1 |
105019857 has 24 divisors (see below), whose sum is σ = 155032488. Its totient is φ = 68486400.
The previous prime is 105019853. The next prime is 105019867. The reversal of 105019857 is 758910501.
105019857 is a `hidden beast` number, since 10 + 501 + 98 + 57 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 3594816 + 101425041 = 1896^2 + 10071^2 .
It is not a de Polignac number, because 105019857 - 22 = 105019853 is a prime.
It is a super-2 number, since 2×1050198572 = 22058340728600898, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105019853) 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 23 ways as a sum of consecutive naturals, for example, 127507 + ... + 128327.
It is an arithmetic number, because the mean of its divisors is an integer number (6459687).
Almost surely, 2105019857 is an apocalyptic number.
It is an amenable number.
105019857 is a deficient number, since it is larger than the sum of its proper divisors (50012631).
105019857 is a wasteful number, since it uses less digits than its factorization.
105019857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1121 (or 1118 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 36.
The square root of 105019857 is about 10247.9196425421. The cubic root of 105019857 is about 471.7991356014.
The spelling of 105019857 in words is "one hundred five million, nineteen thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •