Search a number
-
+
16532171051 = 115925473299
BaseRepresentation
bin11110110010110010…
…01110100100101011
31120200011012022020112
433121121032210223
5232324213433201
611332245444535
71123453064264
oct173131164453
946604168215
1016532171051
117013a85890
12325471074b
1317360c3546
14b2b8dd96b
1566b5b60bb
hex3d964e92b

16532171051 has 8 divisors (see below), whose sum is σ = 18340776000. Its totient is φ = 14774512840.

The previous prime is 16532170987. The next prime is 16532171083. The reversal of 16532171051 is 15017123561.

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

It is a cyclic number.

It is not a de Polignac number, because 16532171051 - 26 = 16532170987 is a prime.

It is a Duffinian number.

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

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

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

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

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

Almost surely, 216532171051 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 25473369.

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

The spelling of 16532171051 in words is "sixteen billion, five hundred thirty-two million, one hundred seventy-one thousand, fifty-one".

Divisors: 1 11 59 649 25473299 280206289 1502924641 16532171051