Search a number
-
+
16504631231 = 112136401911
BaseRepresentation
bin11110101111100000…
…01010111110111111
31120121020101010201012
433113300022332333
5232300141144411
611325423305435
71123000023254
oct172760127677
946536333635
1016504631231
116aaa485800
12324744b27b
1317304a02aa
14b27db142b
15668e7618b
hex3d7c0afbf

16504631231 has 6 divisors (see below), whose sum is σ = 18141454296. Its totient is φ = 15004210100.

The previous prime is 16504631207. The next prime is 16504631239. The reversal of 16504631231 is 13213640561.

It is not a de Polignac number, because 16504631231 - 218 = 16504369087 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 68200835 + ... + 68201076.

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

Almost surely, 216504631231 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 136401933 (or 136401922 counting only the distinct ones).

The product of its (nonzero) digits is 12960, while the sum is 32.

The spelling of 16504631231 in words is "sixteen billion, five hundred four million, six hundred thirty-one thousand, two hundred thirty-one".

Divisors: 1 11 121 136401911 1500421021 16504631231