Base | Representation |
---|---|
bin | 110010001110… |
… | …001000001001 |
3 | 220202212002000 |
4 | 302032020021 |
5 | 11332240230 |
6 | 1150101213 |
7 | 216621054 |
oct | 62161011 |
9 | 26685060 |
10 | 13165065 |
11 | 7482121 |
12 | 44aa809 |
13 | 295c3a4 |
14 | 1a69a9b |
15 | 1250b60 |
hex | c8e209 |
13165065 has 32 divisors (see below), whose sum is σ = 23639040. Its totient is φ = 6951168.
The previous prime is 13165063. The next prime is 13165067. The reversal of 13165065 is 56056131.
It is a happy number.
13165065 is a `hidden beast` number, since 1 + 3 + 1 + 650 + 6 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (13165063) and next prime (13165067).
It is not a de Polignac number, because 13165065 - 21 = 13165063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13165063) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14824 + ... + 15686.
It is an arithmetic number, because the mean of its divisors is an integer number (738720).
Almost surely, 213165065 is an apocalyptic number.
13165065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13165065 is a deficient number, since it is larger than the sum of its proper divisors (10473975).
13165065 is a wasteful number, since it uses less digits than its factorization.
13165065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990 (or 984 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 13165065 is about 3628.3694685079. The cubic root of 13165065 is about 236.1244735024.
The spelling of 13165065 in words is "thirteen million, one hundred sixty-five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •