Base | Representation |
---|---|
bin | 101000100110… |
… | …011100111001 |
3 | 202000201210201 |
4 | 220212130321 |
5 | 10211041012 |
6 | 1020042201 |
7 | 156315622 |
oct | 50463471 |
9 | 22021721 |
10 | 10643257 |
11 | 600a489 |
12 | 3693361 |
13 | 22885b1 |
14 | 15b0a49 |
15 | e03857 |
hex | a26739 |
10643257 has 2 divisors, whose sum is σ = 10643258. Its totient is φ = 10643256.
The previous prime is 10643251. The next prime is 10643263. The reversal of 10643257 is 75234601.
10643257 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 (10643251) and next prime (10643263).
It can be written as a sum of positive squares in only one way, i.e., 6817321 + 3825936 = 2611^2 + 1956^2 .
It is a cyclic number.
It is not a de Polignac number, because 10643257 - 215 = 10610489 is a prime.
It is a super-2 number, since 2×106432572 = 226557839136098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10643251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5321628 + 5321629.
It is an arithmetic number, because the mean of its divisors is an integer number (5321629).
Almost surely, 210643257 is an apocalyptic number.
It is an amenable number.
10643257 is a deficient number, since it is larger than the sum of its proper divisors (1).
10643257 is an equidigital number, since it uses as much as digits as its factorization.
10643257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 10643257 is about 3262.4004965669. The cubic root of 10643257 is about 219.9673298594.
Adding to 10643257 its reverse (75234601), we get a palindrome (85877858).
The spelling of 10643257 in words is "ten million, six hundred forty-three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •