Base | Representation |
---|---|
bin | 100110011000… |
… | …110011010001 |
3 | 200221020220211 |
4 | 212120303101 |
5 | 10034004212 |
6 | 555404121 |
7 | 151351234 |
oct | 46306321 |
9 | 20836824 |
10 | 10063057 |
11 | 5753584 |
12 | 3453641 |
13 | 2114494 |
14 | 149d41b |
15 | d3b9a7 |
hex | 998cd1 |
10063057 has 8 divisors (see below), whose sum is σ = 10319400. Its totient is φ = 9809280.
The previous prime is 10063051. The next prime is 10063063. The reversal of 10063057 is 75036001.
It is an interprime number because it is at equal distance from previous prime (10063051) and next prime (10063063).
It can be written as a sum of positive squares in 4 ways, for example, as 1560001 + 8503056 = 1249^2 + 2916^2 .
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 10063057 - 23 = 10063049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10063051) 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, 9069 + ... + 10117.
It is an arithmetic number, because the mean of its divisors is an integer number (1289925).
Almost surely, 210063057 is an apocalyptic number.
It is an amenable number.
10063057 is a deficient number, since it is larger than the sum of its proper divisors (256343).
10063057 is a wasteful number, since it uses less digits than its factorization.
10063057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283.
The product of its (nonzero) digits is 630, while the sum is 22.
The square root of 10063057 is about 3172.2321793967. The cubic root of 10063057 is about 215.8953611254.
Adding to 10063057 its reverse (75036001), we get a palindrome (85099058).
The spelling of 10063057 in words is "ten million, sixty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •