Search a number
-
+
13691061 = 321521229
BaseRepresentation
bin110100001110…
…100010110101
3221202120121100
4310032202311
512001103221
61205240313
7224241426
oct64164265
927676540
1013691061
11780132a
124703099
132ab4927
141b6564d
151306926
hexd0e8b5

13691061 has 6 divisors (see below), whose sum is σ = 19775990. Its totient is φ = 9127368.

The previous prime is 13691033. The next prime is 13691107. The reversal of 13691061 is 16019631.

13691061 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 can be written as a sum of positive squares in only one way, i.e., 11350161 + 2340900 = 3369^2 + 1530^2 .

It is not a de Polignac number, because 13691061 - 26 = 13690997 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 760606 + ... + 760623.

Almost surely, 213691061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 972, while the sum is 27.

The square root of 13691061 is about 3700.1433756005. The cubic root of 13691061 is about 239.2281977493.

The spelling of 13691061 in words is "thirteen million, six hundred ninety-one thousand, sixty-one".

Divisors: 1 3 9 1521229 4563687 13691061