Base | Representation |
---|---|
bin | 1111001000111100000010… |
… | …1101100011001101010001 |
3 | 2011221100211111020020212021 |
4 | 3302033000231203031101 |
5 | 4140212440222010121 |
6 | 55223101222331441 |
7 | 3335436063425503 |
oct | 362170055431521 |
9 | 64840744206767 |
10 | 16646231438161 |
11 | 53386997537a6 |
12 | 1a4a199289b81 |
13 | 93996b207890 |
14 | 4179791c5d73 |
15 | 1dd017832641 |
hex | f23c0b63351 |
16646231438161 has 8 divisors (see below), whose sum is σ = 17945521612200. Its totient is φ = 15349628525952.
The previous prime is 16646231438113. The next prime is 16646231438219. The reversal of 16646231438161 is 16183413264661.
It can be written as a sum of positive squares in 4 ways, for example, as 104367763600 + 16541863674561 = 323060^2 + 4067169^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16646231438161 - 241 = 14447208182609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16646231438099 and 16646231438108.
It is not an unprimeable number, because it can be changed into a prime (16646231438101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 671802586 + ... + 671827363.
It is an arithmetic number, because the mean of its divisors is an integer number (2243190201525).
Almost surely, 216646231438161 is an apocalyptic number.
It is an amenable number.
16646231438161 is a deficient number, since it is larger than the sum of its proper divisors (1299290174039).
16646231438161 is a wasteful number, since it uses less digits than its factorization.
16646231438161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1343630915.
The product of its digits is 2985984, while the sum is 52.
The spelling of 16646231438161 in words is "sixteen trillion, six hundred forty-six billion, two hundred thirty-one million, four hundred thirty-eight thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •