Base | Representation |
---|---|
bin | 10110110110101100111110… |
… | …000111000000001111001101 |
3 | 111011220020210010112012201101 |
4 | 112312230332013000033031 |
5 | 101133324044340323121 |
6 | 553440253122143101 |
7 | 30113024121610600 |
oct | 2666547607001715 |
9 | 434806703465641 |
10 | 100516161651661 |
11 | 2a03373488a788 |
12 | b3348571b1a91 |
13 | 44118306983c2 |
14 | 1ab7018646337 |
15 | b949c91ca491 |
hex | 5b6b3e1c03cd |
100516161651661 has 12 divisors (see below), whose sum is σ = 119778840716220. Its totient is φ = 84055326815040.
The previous prime is 100516161651649. The next prime is 100516161651667. The reversal of 100516161651661 is 166156161615001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 46108853122500 + 54407308529161 = 6790350^2 + 7376131^2 .
It is not a de Polignac number, because 100516161651661 - 215 = 100516161618893 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100516161651667) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25016464306 + ... + 25016468323.
It is an arithmetic number, because the mean of its divisors is an integer number (9981570059685).
Almost surely, 2100516161651661 is an apocalyptic number.
It is an amenable number.
100516161651661 is a deficient number, since it is larger than the sum of its proper divisors (19262679064559).
100516161651661 is an equidigital number, since it uses as much as digits as its factorization.
100516161651661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50032932684 (or 50032932677 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 46.
The spelling of 100516161651661 in words is "one hundred trillion, five hundred sixteen billion, one hundred sixty-one million, six hundred fifty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •