Base | Representation |
---|---|
bin | 1111010001010101000010… |
… | …0101110101010101111001 |
3 | 2012110010220101210001212022 |
4 | 3310111100211311111321 |
5 | 4200043144042131121 |
6 | 55413221014324225 |
7 | 3352031151566651 |
oct | 364252045652571 |
9 | 65403811701768 |
10 | 16790379255161 |
11 | 539383a402176 |
12 | 1a72108059675 |
13 | 94a431204655 |
14 | 420931645361 |
15 | 1e1b52776aab |
hex | f4550975579 |
16790379255161 has 2 divisors, whose sum is σ = 16790379255162. Its totient is φ = 16790379255160.
The previous prime is 16790379255149. The next prime is 16790379255187. The reversal of 16790379255161 is 16155297309761.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12811674835600 + 3978704419561 = 3579340^2 + 1994669^2 .
It is a cyclic number.
It is not a de Polignac number, because 16790379255161 - 226 = 16790312146297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16790379255094 and 16790379255103.
It is not a weakly prime, because it can be changed into another prime (16790379255121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8395189627580 + 8395189627581.
It is an arithmetic number, because the mean of its divisors is an integer number (8395189627581).
Almost surely, 216790379255161 is an apocalyptic number.
It is an amenable number.
16790379255161 is a deficient number, since it is larger than the sum of its proper divisors (1).
16790379255161 is an equidigital number, since it uses as much as digits as its factorization.
16790379255161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21432600, while the sum is 62.
The spelling of 16790379255161 in words is "sixteen trillion, seven hundred ninety billion, three hundred seventy-nine million, two hundred fifty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •