Base | Representation |
---|---|
bin | 100110101110… |
… | …001011100001 |
3 | 201002201001002 |
4 | 212232023201 |
5 | 10044310000 |
6 | 1001321345 |
7 | 152164442 |
oct | 46561341 |
9 | 21081032 |
10 | 10150625 |
11 | 5803351 |
12 | 3496255 |
13 | 21452b4 |
14 | 14c32c9 |
15 | d578d5 |
hex | 9ae2e1 |
10150625 has 20 divisors (see below), whose sum is σ = 12886500. Its totient is φ = 7992000.
The previous prime is 10150607. The next prime is 10150627. The reversal of 10150625 is 52605101.
10150625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 10 ways, for example, as 8720209 + 1430416 = 2953^2 + 1196^2 .
It is not a de Polignac number, because 10150625 - 26 = 10150561 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10150597 and 10150606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10150627) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 68051 + ... + 68199.
It is an arithmetic number, because the mean of its divisors is an integer number (644325).
Almost surely, 210150625 is an apocalyptic number.
It is an amenable number.
10150625 is a deficient number, since it is larger than the sum of its proper divisors (2735875).
10150625 is an equidigital number, since it uses as much as digits as its factorization.
10150625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 278 (or 263 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 10150625 is about 3186.0045511581. The cubic root of 10150625 is about 216.5197886856.
Adding to 10150625 its reverse (52605101), we get a palindrome (62755726).
The spelling of 10150625 in words is "ten million, one hundred fifty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •