Search a number
-
+
13565160361 = 83163435667
BaseRepresentation
bin11001010001000101…
…11110101110101001
31022000101020112201201
430220202332232221
5210240140112421
610122020244201
7660104650324
oct145042765651
938011215651
1013565160361
1158311a7835
122766b40661
1313824bc80c
149298437bb
15545d8bb91
hex3288beba9

13565160361 has 4 divisors (see below), whose sum is σ = 13728596112. Its totient is φ = 13401724612.

The previous prime is 13565160347. The next prime is 13565160377. The reversal of 13565160361 is 16306156531.

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: 16306156531 = 72329450933.

It is a cyclic number.

It is not a de Polignac number, because 13565160361 - 213 = 13565152169 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 13565160361.

It is not an unprimeable number, because it can be changed into a prime (13565160311) 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, 81717751 + ... + 81717916.

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

Almost surely, 213565160361 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 163435750.

The product of its (nonzero) digits is 48600, while the sum is 37.

The spelling of 13565160361 in words is "thirteen billion, five hundred sixty-five million, one hundred sixty thousand, three hundred sixty-one".

Divisors: 1 83 163435667 13565160361