Search a number
-
+
13496196931 = 71928028133
BaseRepresentation
bin11001001000110111…
…11001111101000011
31021211120110211200121
430210123321331003
5210120011300211
610111114201111
7655306531630
oct144433717503
937746424617
1013496196931
1157a6284568
122747a23197
131371124a59
14920611187
1553ecb8271
hex3246f9f43

13496196931 has 4 divisors (see below), whose sum is σ = 15424225072. Its totient is φ = 11568168792.

The previous prime is 13496196911. The next prime is 13496196937. The reversal of 13496196931 is 13969169431.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13969169431 = 71995595633.

It is a cyclic number.

It is not a de Polignac number, because 13496196931 - 25 = 13496196899 is a prime.

It is a super-2 number, since 2×134961969312 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 213496196931 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1928028140.

The product of its digits is 944784, while the sum is 52.

The spelling of 13496196931 in words is "thirteen billion, four hundred ninety-six million, one hundred ninety-six thousand, nine hundred thirty-one".

Divisors: 1 7 1928028133 13496196931