Base | Representation |
---|---|
bin | 100000000011000000001 |
3 | 1222100111002 |
4 | 10000120001 |
5 | 232100423 |
6 | 34301345 |
7 | 11632361 |
oct | 4003001 |
9 | 1870432 |
10 | 1050113 |
11 | 657a69 |
12 | 427855 |
13 | 2a9c8c |
14 | 1d49a1 |
15 | 15b228 |
hex | 100601 |
1050113 has 4 divisors (see below), whose sum is σ = 1055748. Its totient is φ = 1044480.
The previous prime is 1050083. The next prime is 1050139. The reversal of 1050113 is 3110501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3110501 = 263 ⋅11827.
It can be written as a sum of positive squares in 2 ways, for example, as 506944 + 543169 = 712^2 + 737^2 .
It is a cyclic number.
It is not a de Polignac number, because 1050113 - 28 = 1049857 is a prime.
It is a super-2 number, since 2×10501132 = 2205474625538, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1050094 and 1050103.
It is not an unprimeable number, because it can be changed into a prime (1050013) 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, 2528 + ... + 2913.
It is an arithmetic number, because the mean of its divisors is an integer number (263937).
21050113 is an apocalyptic number.
It is an amenable number.
1050113 is a deficient number, since it is larger than the sum of its proper divisors (5635).
1050113 is an equidigital number, since it uses as much as digits as its factorization.
1050113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5634.
The product of its (nonzero) digits is 15, while the sum is 11.
The square root of 1050113 is about 1024.7502134667. The cubic root of 1050113 is about 101.6432816710.
Adding to 1050113 its reverse (3110501), we get a palindrome (4160614).
The spelling of 1050113 in words is "one million, fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •