Base | Representation |
---|---|
bin | 101000101110… |
… | …011100010001 |
3 | 202002101200212 |
4 | 220232130101 |
5 | 10213112420 |
6 | 1020453505 |
7 | 156513215 |
oct | 50563421 |
9 | 22071625 |
10 | 10675985 |
11 | 6032031 |
12 | 36aa295 |
13 | 229a468 |
14 | 15bc945 |
15 | e0d3c5 |
hex | a2e711 |
10675985 has 4 divisors (see below), whose sum is σ = 12811188. Its totient is φ = 8540784.
The previous prime is 10675969. The next prime is 10676047. The reversal of 10675985 is 58957601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 58957601 = 43 ⋅1371107.
It can be written as a sum of positive squares in 2 ways, for example, as 8386816 + 2289169 = 2896^2 + 1513^2 .
It is a cyclic number.
It is not a de Polignac number, because 10675985 - 24 = 10675969 is a prime.
It is a super-2 number, since 2×106759852 = 227953311440450, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1067594 + ... + 1067603.
It is an arithmetic number, because the mean of its divisors is an integer number (3202797).
Almost surely, 210675985 is an apocalyptic number.
It is an amenable number.
10675985 is a deficient number, since it is larger than the sum of its proper divisors (2135203).
10675985 is an equidigital number, since it uses as much as digits as its factorization.
10675985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2135202.
The product of its (nonzero) digits is 75600, while the sum is 41.
The square root of 10675985 is about 3267.4125849057. The cubic root of 10675985 is about 220.1925655584.
The spelling of 10675985 in words is "ten million, six hundred seventy-five thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •