Base | Representation |
---|---|
bin | 1100100001110… |
… | …01100000000111 |
3 | 21022202021200001 |
4 | 12100321200013 |
5 | 203400440002 |
6 | 14232302131 |
7 | 2414163646 |
oct | 620714007 |
9 | 238667601 |
10 | 105093127 |
11 | 54360027 |
12 | 2b241947 |
13 | 18a07aa9 |
14 | dd5935d |
15 | 935da87 |
hex | 6439807 |
105093127 has 8 divisors (see below), whose sum is σ = 108385200. Its totient is φ = 101835840.
The previous prime is 105093103. The next prime is 105093143. The reversal of 105093127 is 721390501.
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 105093127 - 223 = 96704519 is a prime.
It is a super-2 number, since 2×1050931272 = 22089130685276258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105093095 and 105093104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105096127) 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, 2493 + ... + 14710.
It is an arithmetic number, because the mean of its divisors is an integer number (13548150).
Almost surely, 2105093127 is an apocalyptic number.
105093127 is a deficient number, since it is larger than the sum of its proper divisors (3292073).
105093127 is a wasteful number, since it uses less digits than its factorization.
105093127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17393.
The product of its (nonzero) digits is 1890, while the sum is 28.
The square root of 105093127 is about 10251.4938911361. The cubic root of 105093127 is about 471.9088313214.
The spelling of 105093127 in words is "one hundred five million, ninety-three thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •