Search a number
-
+
13668079665 = 35911205311
BaseRepresentation
bin11001011101010111…
…00101100000110001
31022021112220101110210
430232223211200301
5210443012022130
610140134214333
7662464521522
oct145653454061
938245811423
1013668079665
115884302609
1227954b43a9
13139a916006
14939394849
1554ee1b5b0
hex32eae5831

13668079665 has 8 divisors (see below), whose sum is σ = 21868927488. Its totient is φ = 7289642480.

The previous prime is 13668079657. The next prime is 13668079669. The reversal of 13668079665 is 56697086631.

13668079665 is digitally balanced in base 2, 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 not a de Polignac number, because 13668079665 - 23 = 13668079657 is a prime.

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

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, 455602641 + ... + 455602670.

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

Almost surely, 213668079665 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 911205319.

The product of its (nonzero) digits is 9797760, while the sum is 57.

The spelling of 13668079665 in words is "thirteen billion, six hundred sixty-eight million, seventy-nine thousand, six hundred sixty-five".

Divisors: 1 3 5 15 911205311 2733615933 4556026555 13668079665