Search a number
-
+
13025910 = 2351725541
BaseRepresentation
bin110001101100…
…001001110110
3220111210012010
4301230021312
511313312120
61143105050
7215501262
oct61541166
926453163
1013025910
117397617
124442186
132910c51
141a310a2
1512247e0
hexc6c276

13025910 has 32 divisors (see below), whose sum is σ = 33102432. Its totient is φ = 3269120.

The previous prime is 13025899. The next prime is 13025911. The reversal of 13025910 is 1952031.

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

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13025911) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12261 + ... + 13280.

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

Almost surely, 213025910 is an apocalyptic number.

13025910 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

13025910 is an abundant number, since it is smaller than the sum of its proper divisors (20076522).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

13025910 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 25568.

The product of its (nonzero) digits is 270, while the sum is 21.

The square root of 13025910 is about 3609.1425574505. The cubic root of 13025910 is about 235.2895781355.

Adding to 13025910 its reverse (1952031), we get a palindrome (14977941).

The spelling of 13025910 in words is "thirteen million, twenty-five thousand, nine hundred ten".

Divisors: 1 2 3 5 6 10 15 17 30 34 51 85 102 170 255 510 25541 51082 76623 127705 153246 255410 383115 434197 766230 868394 1302591 2170985 2605182 4341970 6512955 13025910