Search a number
-
+
13040405281 = 115111329631
BaseRepresentation
bin11000010010100010…
…01100101100100001
31020122210211020002101
430021101030230201
5203201320432111
65553553050401
7641103421201
oct141121145441
936583736071
1013040405281
115591a72552
12263b256a01
1312ca87ab57
148b9c86401
15514c83bc1
hex30944cb21

13040405281 has 4 divisors (see below), whose sum is σ = 13051736064. Its totient is φ = 13029074500.

The previous prime is 13040405251. The next prime is 13040405303. The reversal of 13040405281 is 18250404031.

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, and also an emirpimes, since its reverse is a distinct semiprime: 18250404031 = 37493254163.

It is a cyclic number.

It is not a de Polignac number, because 13040405281 - 25 = 13040405249 is a prime.

It is a super-2 number, since 2×130404052812 (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 (13040405221) by changing a digit.

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

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

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

Almost surely, 213040405281 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 11330782.

The product of its (nonzero) digits is 3840, while the sum is 28.

The spelling of 13040405281 in words is "thirteen billion, forty million, four hundred five thousand, two hundred eighty-one".

Divisors: 1 1151 11329631 13040405281