Search a number
-
+
13051064 = 2313671873
BaseRepresentation
bin110001110010…
…010010111000
3220120001200202
4301302102320
511320113224
61143421332
7215634515
oct61622270
926501622
1013051064
117404504
124454848
13291c530
141a3a30c
15122beae
hexc724b8

13051064 has 32 divisors (see below), whose sum is σ = 26760720. Its totient is φ = 5930496.

The previous prime is 13051063. The next prime is 13051109. The reversal of 13051064 is 46015031.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (13051061) 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 7 ways as a sum of consecutive naturals, for example, 6032 + ... + 7904.

Almost surely, 213051064 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 13051064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13380360).

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

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

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

13051064 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1959 (or 1955 counting only the distinct ones).

The product of its (nonzero) digits is 360, while the sum is 20.

The square root of 13051064 is about 3612.6256379536. The cubic root of 13051064 is about 235.4409346359.

Adding to 13051064 its reverse (46015031), we get a palindrome (59066095).

The spelling of 13051064 in words is "thirteen million, fifty-one thousand, sixty-four".

Divisors: 1 2 4 8 13 26 52 67 104 134 268 536 871 1742 1873 3484 3746 6968 7492 14984 24349 48698 97396 125491 194792 250982 501964 1003928 1631383 3262766 6525532 13051064