Base | Representation |
---|---|
bin | 101000101001… |
… | …010101011001 |
3 | 202001100000001 |
4 | 220221111121 |
5 | 10211430230 |
6 | 1020213001 |
7 | 156365221 |
oct | 50512531 |
9 | 22040001 |
10 | 10655065 |
11 | 6018343 |
12 | 369a161 |
13 | 2290a95 |
14 | 15b5081 |
15 | e070ca |
hex | a29559 |
10655065 has 4 divisors (see below), whose sum is σ = 12786084. Its totient is φ = 8524048.
The previous prime is 10655059. The next prime is 10655069. The reversal of 10655065 is 56055601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 56055601 = 7 ⋅8007943.
It can be written as a sum of positive squares in 2 ways, for example, as 3952144 + 6702921 = 1988^2 + 2589^2 .
It is a cyclic number.
It is not a de Polignac number, because 10655065 - 25 = 10655033 is a prime.
It is a super-2 number, since 2×106550652 = 227060820308450, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10655069) by changing a digit.
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, 1065502 + ... + 1065511.
It is an arithmetic number, because the mean of its divisors is an integer number (3196521).
Almost surely, 210655065 is an apocalyptic number.
It is an amenable number.
10655065 is a deficient number, since it is larger than the sum of its proper divisors (2131019).
10655065 is an equidigital number, since it uses as much as digits as its factorization.
10655065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2131018.
The product of its (nonzero) digits is 4500, while the sum is 28.
The square root of 10655065 is about 3264.2097052732. The cubic root of 10655065 is about 220.0486462674.
The spelling of 10655065 in words is "ten million, six hundred fifty-five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •