Base | Representation |
---|---|
bin | 100111000111… |
… | …111101001101 |
3 | 201022001212110 |
4 | 213013331031 |
5 | 10111144310 |
6 | 1003454233 |
7 | 153114321 |
oct | 47077515 |
9 | 21261773 |
10 | 10256205 |
11 | 5875703 |
12 | 3527379 |
13 | 218137b |
14 | 150d981 |
15 | d78d20 |
hex | 9c7f4d |
10256205 has 8 divisors (see below), whose sum is σ = 16409952. Its totient is φ = 5469968.
The previous prime is 10256201. The next prime is 10256209. The reversal of 10256205 is 50265201.
10256205 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10256201) and next prime (10256209).
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 10256205 - 22 = 10256201 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10256201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 341859 + ... + 341888.
It is an arithmetic number, because the mean of its divisors is an integer number (2051244).
Almost surely, 210256205 is an apocalyptic number.
10256205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10256205 is a deficient number, since it is larger than the sum of its proper divisors (6153747).
10256205 is an equidigital number, since it uses as much as digits as its factorization.
10256205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683755.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 10256205 is about 3202.5310302946. The cubic root of 10256205 is about 217.2678987921.
The spelling of 10256205 in words is "ten million, two hundred fifty-six thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •