Base | Representation |
---|---|
bin | 1100100001000… |
… | …11000001100001 |
3 | 21022120121101001 |
4 | 12100203001201 |
5 | 203340013212 |
6 | 14230312001 |
7 | 2413331350 |
oct | 620430141 |
9 | 238517331 |
10 | 105001057 |
11 | 542a7937 |
12 | 2b1b8601 |
13 | 189a4c05 |
14 | dd33997 |
15 | 9341657 |
hex | 6423061 |
105001057 has 4 divisors (see below), whose sum is σ = 120001216. Its totient is φ = 90000900.
The previous prime is 105001051. The next prime is 105001073. The reversal of 105001057 is 750100501.
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, and also an emirpimes, since its reverse is a distinct semiprime: 750100501 = 5039 ⋅148859.
It is a cyclic number.
It is not a de Polignac number, because 105001057 - 223 = 96612449 is a prime.
It is a super-2 number, since 2×1050010572 = 22050443942234498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105001051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7500069 + ... + 7500082.
It is an arithmetic number, because the mean of its divisors is an integer number (30000304).
Almost surely, 2105001057 is an apocalyptic number.
It is an amenable number.
105001057 is a deficient number, since it is larger than the sum of its proper divisors (15000159).
105001057 is an equidigital number, since it uses as much as digits as its factorization.
105001057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15000158.
The product of its (nonzero) digits is 175, while the sum is 19.
The square root of 105001057 is about 10247.0023421487. The cubic root of 105001057 is about 471.7709810748.
Adding to 105001057 its reverse (750100501), we get a palindrome (855101558).
The spelling of 105001057 in words is "one hundred five million, one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •