Search a number
-
+
13010765 = 53477499
BaseRepresentation
bin110001101000…
…011101001101
3220111000102012
4301220131031
511312321030
61142511005
7215406155
oct61503515
926430365
1013010765
1173871a9
124435465
1329070a1
141a29765
151220095
hexc6874d

13010765 has 8 divisors (see below), whose sum is σ = 15660000. Its totient is φ = 10377232.

The previous prime is 13010749. The next prime is 13010771. The reversal of 13010765 is 56701031.

13010765 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 13010765 - 24 = 13010749 is a prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 13010765.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2015 + ... + 5484.

It is an arithmetic number, because the mean of its divisors is an integer number (1957500).

Almost surely, 213010765 is an apocalyptic number.

It is an amenable number.

13010765 is a deficient number, since it is larger than the sum of its proper divisors (2649235).

13010765 is an equidigital number, since it uses as much as digits as its factorization.

13010765 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 7851.

The product of its (nonzero) digits is 630, while the sum is 23.

The square root of 13010765 is about 3607.0438034490. The cubic root of 13010765 is about 235.1983537319.

Adding to 13010765 its reverse (56701031), we get a palindrome (69711796).

The spelling of 13010765 in words is "thirteen million, ten thousand, seven hundred sixty-five".

Divisors: 1 5 347 1735 7499 37495 2602153 13010765