Base | Representation |
---|---|
bin | 101000111110… |
… | …101101100001 |
3 | 202012210010000 |
4 | 220332231201 |
5 | 10222231000 |
6 | 1022130213 |
7 | 160211415 |
oct | 50765541 |
9 | 22183100 |
10 | 10742625 |
11 | 6078103 |
12 | 3720969 |
13 | 22c18aa |
14 | 15d8d45 |
15 | e23000 |
hex | a3eb61 |
10742625 has 40 divisors (see below), whose sum is σ = 20046312. Its totient is φ = 5724000.
The previous prime is 10742621. The next prime is 10742629. The reversal of 10742625 is 52624701.
It is an interprime number because it is at equal distance from previous prime (10742621) and next prime (10742629).
It can be written as a sum of positive squares in 4 ways, for example, as 186624 + 10556001 = 432^2 + 3249^2 .
It is not a de Polignac number, because 10742625 - 22 = 10742621 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (10742621) 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 39 ways as a sum of consecutive naturals, for example, 9595 + ... + 10655.
Almost surely, 210742625 is an apocalyptic number.
10742625 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10742625 is a deficient number, since it is larger than the sum of its proper divisors (9303687).
10742625 is an equidigital number, since it uses as much as digits as its factorization.
10742625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1088 (or 1069 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 10742625 is about 3277.5943922334. The cubic root of 10742625 is about 220.6497663643.
The spelling of 10742625 in words is "ten million, seven hundred forty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •