Base | Representation |
---|---|
bin | 11110001011010100… |
… | …00111000111011101 |
3 | 1112211002010202011120 |
4 | 33011222013013131 |
5 | 231134432141022 |
6 | 11235340441153 |
7 | 1112322450420 |
oct | 170552070735 |
9 | 45732122146 |
10 | 16201052637 |
11 | 6964087700 |
12 | 31818491b9 |
13 | 16b261b6a3 |
14 | ad99499b7 |
15 | 64c4abd5c |
hex | 3c5a871dd |
16201052637 has 48 divisors (see below), whose sum is σ = 27177862656. Its totient is φ = 8403040800.
The previous prime is 16201052629. The next prime is 16201052641. The reversal of 16201052637 is 73625010261.
It is not a de Polignac number, because 16201052637 - 23 = 16201052629 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 16201052598 and 16201052607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16201052627) 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 47 ways as a sum of consecutive naturals, for example, 1751218 + ... + 1760444.
It is an arithmetic number, because the mean of its divisors is an integer number (566205472).
Almost surely, 216201052637 is an apocalyptic number.
It is an amenable number.
16201052637 is a deficient number, since it is larger than the sum of its proper divisors (10976810019).
16201052637 is a wasteful number, since it uses less digits than its factorization.
16201052637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9950 (or 9939 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 33.
Adding to 16201052637 its reverse (73625010261), we get a palindrome (89826062898).
The spelling of 16201052637 in words is "sixteen billion, two hundred one million, fifty-two thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •