Search a number
-
+
13481695 = 519713687
BaseRepresentation
bin110011011011…
…011011011111
3221100221102001
4303123123133
511422403240
61200543131
7222410143
oct63333337
927327361
1013481695
117678aa7
124621aa7
132a40546
141b0d223
1512b489a
hexcdb6df

13481695 has 8 divisors (see below), whose sum is σ = 16261344. Its totient is φ = 10729824.

The previous prime is 13481687. The next prime is 13481701. The reversal of 13481695 is 59618431.

13481695 is digitally balanced in base 3, 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 13481695 - 23 = 13481687 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 213481695 is an apocalyptic number.

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

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

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

The sum of its prime factors is 13889.

The product of its digits is 25920, while the sum is 37.

The square root of 13481695 is about 3671.7427742150. The cubic root of 13481695 is about 238.0024892050.

The spelling of 13481695 in words is "thirteen million, four hundred eighty-one thousand, six hundred ninety-five".

Divisors: 1 5 197 985 13687 68435 2696339 13481695