Base | Representation |
---|---|
bin | 101001011010… |
… | …011001111001 |
3 | 202102112201012 |
4 | 221122121321 |
5 | 10234343212 |
6 | 1024403305 |
7 | 161163212 |
oct | 51323171 |
9 | 22375635 |
10 | 10856057 |
11 | 6145353 |
12 | 3776535 |
13 | 2331404 |
14 | 1628409 |
15 | e46922 |
hex | a5a679 |
10856057 has 4 divisors (see below), whose sum is σ = 10912500. Its totient is φ = 10799616.
The previous prime is 10856009. The next prime is 10856071. The reversal of 10856057 is 75065801.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75065801 = 761 ⋅98641.
It can be written as a sum of positive squares in 2 ways, for example, as 6739216 + 4116841 = 2596^2 + 2029^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10856057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10856257) 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 3 ways as a sum of consecutive naturals, for example, 27932 + ... + 28317.
It is an arithmetic number, because the mean of its divisors is an integer number (2728125).
Almost surely, 210856057 is an apocalyptic number.
It is an amenable number.
10856057 is a deficient number, since it is larger than the sum of its proper divisors (56443).
10856057 is an equidigital number, since it uses as much as digits as its factorization.
10856057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56442.
The product of its (nonzero) digits is 8400, while the sum is 32.
The square root of 10856057 is about 3294.8531074996. The cubic root of 10856057 is about 221.4236667265.
It can be divided in two parts, 108 and 56057, that added together give a palindrome (56165).
The spelling of 10856057 in words is "ten million, eight hundred fifty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •