Base | Representation |
---|---|
bin | 101001000000… |
… | …111111110001 |
3 | 202020020221200 |
4 | 221000333301 |
5 | 10223030420 |
6 | 1022241413 |
7 | 160250616 |
oct | 51007761 |
9 | 22206850 |
10 | 10751985 |
11 | 6084142 |
12 | 3726269 |
13 | 22c5c2a |
14 | 15dc50d |
15 | e25b90 |
hex | a40ff1 |
10751985 has 24 divisors (see below), whose sum is σ = 18718440. Its totient is φ = 5709312.
The previous prime is 10751981. The next prime is 10751987. The reversal of 10751985 is 58915701.
10751985 = 6182 + 6192 + ... + 6442.
10751985 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 4 ways, for example, as 144 + 10751841 = 12^2 + 3279^2 .
It is not a de Polignac number, because 10751985 - 22 = 10751981 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10751981) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14811 + ... + 15519.
It is an arithmetic number, because the mean of its divisors is an integer number (779935).
Almost surely, 210751985 is an apocalyptic number.
10751985 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10751985 is a deficient number, since it is larger than the sum of its proper divisors (7966455).
10751985 is a wasteful number, since it uses less digits than its factorization.
10751985 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1057 (or 1054 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 36.
The square root of 10751985 is about 3279.0219578405. The cubic root of 10751985 is about 220.7138314719.
The spelling of 10751985 in words is "ten million, seven hundred fifty-one thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •