Base | Representation |
---|---|
bin | 11101111111100001… |
… | …01111100000010100 |
3 | 1112120011222211120122 |
4 | 32333300233200110 |
5 | 230434121041021 |
6 | 11221444251112 |
7 | 1110011553350 |
oct | 167760574024 |
9 | 45504884518 |
10 | 16102127636 |
11 | 691325a901 |
12 | 31546a0a98 |
13 | 1697c9329a |
14 | aca758460 |
15 | 64396abab |
hex | 3bfc2f814 |
16102127636 has 12 divisors (see below), whose sum is σ = 32204255328. Its totient is φ = 6900911832.
The previous prime is 16102127633. The next prime is 16102127647. The reversal of 16102127636 is 63672120161.
16102127636 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 16102127596 and 16102127605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16102127633) 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 3 ways as a sum of consecutive naturals, for example, 287537966 + ... + 287538021.
It is an arithmetic number, because the mean of its divisors is an integer number (2683687944).
Almost surely, 216102127636 is an apocalyptic number.
It is an amenable number.
16102127636 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16102127636 is a wasteful number, since it uses less digits than its factorization.
16102127636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575075998 (or 575075996 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 35.
Adding to 16102127636 its reverse (63672120161), we get a palindrome (79774247797).
The spelling of 16102127636 in words is "sixteen billion, one hundred two million, one hundred twenty-seven thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •