Search a number
-
+
13370161 = 71910023
BaseRepresentation
bin110011000000…
…001100110001
3221011021102011
4303000030301
511410321121
61154322521
7221434030
oct63001461
927137364
1013370161
117602222
124589441
132a0184c
141ac0717
1512917e1
hexcc0331

13370161 has 4 divisors (see below), whose sum is σ = 15280192. Its totient is φ = 11460132.

The previous prime is 13370117. The next prime is 13370171. The reversal of 13370161 is 16107331.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 13370161 - 215 = 13337393 is a prime.

It is a super-2 number, since 2×133701612 = 357522410331842, which contains 22 as substring.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 955005 + ... + 955018.

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

Almost surely, 213370161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1910030.

The product of its (nonzero) digits is 378, while the sum is 22.

The square root of 13370161 is about 3656.5230752725. The cubic root of 13370161 is about 237.3443397367.

Adding to 13370161 its reverse (16107331), we get a palindrome (29477492).

It can be divided in two parts, 13370 and 161, that added together give a palindrome (13531).

The spelling of 13370161 in words is "thirteen million, three hundred seventy thousand, one hundred sixty-one".

Divisors: 1 7 1910023 13370161