Base | Representation |
---|---|
bin | 100110100111… |
… | …100010011001 |
3 | 201001022201101 |
4 | 212213202121 |
5 | 10042422132 |
6 | 1000551401 |
7 | 152022223 |
oct | 46474231 |
9 | 21038641 |
10 | 10123417 |
11 | 5794967 |
12 | 3482561 |
13 | 2135ab5 |
14 | 14b7413 |
15 | d4e7e7 |
hex | 9a7899 |
10123417 has 2 divisors, whose sum is σ = 10123418. Its totient is φ = 10123416.
The previous prime is 10123411. The next prime is 10123423. The reversal of 10123417 is 71432101.
10123417 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (10123411) and next prime (10123423).
It can be written as a sum of positive squares in only one way, i.e., 9634816 + 488601 = 3104^2 + 699^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10123417 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10123394 and 10123403.
It is not a weakly prime, because it can be changed into another prime (10123411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061708 + 5061709.
It is an arithmetic number, because the mean of its divisors is an integer number (5061709).
Almost surely, 210123417 is an apocalyptic number.
It is an amenable number.
10123417 is a deficient number, since it is larger than the sum of its proper divisors (1).
10123417 is an equidigital number, since it uses as much as digits as its factorization.
10123417 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 19.
The square root of 10123417 is about 3181.7317611640. The cubic root of 10123417 is about 216.3261604841.
Adding to 10123417 its reverse (71432101), we get a palindrome (81555518).
The spelling of 10123417 in words is "ten million, one hundred twenty-three thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •