Base | Representation |
---|---|
bin | 11101111001100000… |
… | …00011110101101011 |
3 | 1112102122221122012012 |
4 | 32330300003311223 |
5 | 230333203222011 |
6 | 11212441510135 |
7 | 1105526331404 |
oct | 167460036553 |
9 | 45378848165 |
10 | 16051617131 |
11 | 68977a0590 |
12 | 313b7a234b |
13 | 168a689704 |
14 | ac3b6a9ab |
15 | 63e2dea8b |
hex | 3bcc03d6b |
16051617131 has 32 divisors (see below), whose sum is σ = 19512299520. Its totient is φ = 13041705600.
The previous prime is 16051617121. The next prime is 16051617151. The reversal of 16051617131 is 13171615061.
It is not a de Polignac number, because 16051617131 - 26 = 16051617067 is a prime.
It is a super-2 number, since 2×160516171312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16051617121) 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 31 ways as a sum of consecutive naturals, for example, 192161 + ... + 262733.
It is an arithmetic number, because the mean of its divisors is an integer number (609759360).
Almost surely, 216051617131 is an apocalyptic number.
16051617131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
16051617131 is a deficient number, since it is larger than the sum of its proper divisors (3460682389).
16051617131 is a wasteful number, since it uses less digits than its factorization.
16051617131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70667.
The product of its (nonzero) digits is 3780, while the sum is 32.
The spelling of 16051617131 in words is "sixteen billion, fifty-one million, six hundred seventeen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •