Search a number
-
+
13896548565 = 35926436571
BaseRepresentation
bin11001111000100110…
…01000000011010101
31022212110210210212220
430330103020003111
5211430004023230
610214535132553
71001240466564
oct147423100325
938773723786
1013896548565
11599126a689
122839b14159
13140605a403
1495b867bdb
15564eead10
hex33c4c80d5

13896548565 has 8 divisors (see below), whose sum is σ = 22234477728. Its totient is φ = 7411492560.

The previous prime is 13896548563. The next prime is 13896548581. The reversal of 13896548565 is 56584569831.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 13896548565 - 21 = 13896548563 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 13896548499 and 13896548508.

It is a congruent number.

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

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

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

Almost surely, 213896548565 is an apocalyptic number.

13896548565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 926436579.

The product of its digits is 31104000, while the sum is 60.

The spelling of 13896548565 in words is "thirteen billion, eight hundred ninety-six million, five hundred forty-eight thousand, five hundred sixty-five".

Divisors: 1 3 5 15 926436571 2779309713 4632182855 13896548565