Base | Representation |
---|---|
bin | 100111000110… |
… | …100110101101 |
3 | 201021210021102 |
4 | 213012212231 |
5 | 10111010134 |
6 | 1003412445 |
7 | 153062222 |
oct | 47064655 |
9 | 21253242 |
10 | 10250669 |
11 | 5871530 |
12 | 3524125 |
13 | 217b9b0 |
14 | 150b949 |
15 | d7737e |
hex | 9c69ad |
10250669 has 16 divisors (see below), whose sum is σ = 12183360. Its totient is φ = 8501760.
The previous prime is 10250657. The next prime is 10250683. The reversal of 10250669 is 96605201.
10250669 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10250669 is a prime.
It is a super-2 number, since 2×102506692 = 210152429895122, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10250069) 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 15 ways as a sum of consecutive naturals, for example, 13502 + ... + 14240.
It is an arithmetic number, because the mean of its divisors is an integer number (761460).
Almost surely, 210250669 is an apocalyptic number.
It is an amenable number.
10250669 is a deficient number, since it is larger than the sum of its proper divisors (1932691).
10250669 is a wasteful number, since it uses less digits than its factorization.
10250669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 860.
The product of its (nonzero) digits is 3240, while the sum is 29.
The square root of 10250669 is about 3201.6665972584. Note that the first 3 decimals coincide. The cubic root of 10250669 is about 217.2288001338.
The spelling of 10250669 in words is "ten million, two hundred fifty thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •