Base | Representation |
---|---|
bin | 100110101000… |
… | …000100110001 |
3 | 201001102201212 |
4 | 212220010301 |
5 | 10043004432 |
6 | 1001005505 |
7 | 152031515 |
oct | 46500461 |
9 | 21042655 |
10 | 10125617 |
11 | 5796587 |
12 | 3483895 |
13 | 2136ab8 |
14 | 14b8145 |
15 | d502b2 |
hex | 9a8131 |
10125617 has 2 divisors, whose sum is σ = 10125618. Its totient is φ = 10125616.
The previous prime is 10125601. The next prime is 10125629. The reversal of 10125617 is 71652101.
10125617 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9541921 + 583696 = 3089^2 + 764^2 .
It is a cyclic number.
It is not a de Polignac number, because 10125617 - 24 = 10125601 is a prime.
It is a super-3 number, since 3×101256173 (a number of 22 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10125592 and 10125601.
It is not a weakly prime, because it can be changed into another prime (10125697) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5062808 + 5062809.
It is an arithmetic number, because the mean of its divisors is an integer number (5062809).
Almost surely, 210125617 is an apocalyptic number.
It is an amenable number.
10125617 is a deficient number, since it is larger than the sum of its proper divisors (1).
10125617 is an equidigital number, since it uses as much as digits as its factorization.
10125617 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 420, while the sum is 23.
The square root of 10125617 is about 3182.0774660589. The cubic root of 10125617 is about 216.3418298667.
Adding to 10125617 its reverse (71652101), we get a palindrome (81777718).
The spelling of 10125617 in words is "ten million, one hundred twenty-five thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •