Search a number
-
+
16156021572 = 22327315739157
BaseRepresentation
bin11110000101111100…
…10101001101000100
31112200221101221011100
433002332111031010
5231041420142242
611231051340100
71111234626465
oct170276251504
945627357140
1016156021572
116940720149
12316a751630
1316a61b2ba2
14ad3986d6c
1564856454c
hex3c2f95344

16156021572 has 72 divisors (see below), whose sum is σ = 41663015576. Its totient is φ = 5277602304.

The previous prime is 16156021543. The next prime is 16156021577. The reversal of 16156021572 is 27512065161.

16156021572 is a `hidden beast` number, since 1 + 6 + 1 + 5 + 60 + 21 + 572 = 666.

16156021572 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 3909500676 + 12246520896 = 62526^2 + 110664^2 .

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

It is a Harshad number since it is a multiple of its sum of digits (36).

It is not an unprimeable number, because it can be changed into a prime (16156021577) 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 23 ways as a sum of consecutive naturals, for example, 393018 + ... + 432174.

Almost surely, 216156021572 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 16156021572, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20831507788).

16156021572 is an abundant number, since it is smaller than the sum of its proper divisors (25506994004).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 25200, while the sum is 36.

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

Divisors: 1 2 3 4 6 9 12 18 36 73 146 157 219 292 314 438 471 628 657 876 942 1314 1413 1884 2628 2826 5652 11461 22922 34383 39157 45844 68766 78314 103149 117471 137532 156628 206298 234942 352413 412596 469884 704826 1409652 2858461 5716922 6147649 8575383 11433844 12295298 17150766 18442947 24590596 25726149 34301532 36885894 51452298 55328841 73771788 102904596 110657682 221315364 448778377 897556754 1346335131 1795113508 2692670262 4039005393 5385340524 8078010786 16156021572