Base | Representation |
---|---|
bin | 100110010000000011011000… |
… | …011010010011001110000011 |
3 | 211001122112012222022022002022 |
4 | 212100003120122103032003 |
5 | 134022230301403312401 |
6 | 1353443143321112055 |
7 | 50302065132531113 |
oct | 4620033032231603 |
9 | 731575188268068 |
10 | 168228909822851 |
11 | 4966a530970499 |
12 | 16a4ba8162862b |
13 | 72b3bc217abb7 |
14 | 2d78473611043 |
15 | 146b0477e071b |
hex | 9900d8693383 |
168228909822851 has 2 divisors, whose sum is σ = 168228909822852. Its totient is φ = 168228909822850.
The previous prime is 168228909822653. The next prime is 168228909822991. The reversal of 168228909822851 is 158228909822861.
It is a strong prime.
It is an emirp because it is prime and its reverse (158228909822861) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-168228909822851 is a prime.
It is a super-2 number, since 2×1682289098228512 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (168228909824851) 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 as a sum of consecutive naturals, namely, 84114454911425 + 84114454911426.
It is an arithmetic number, because the mean of its divisors is an integer number (84114454911426).
Almost surely, 2168228909822851 is an apocalyptic number.
168228909822851 is a deficient number, since it is larger than the sum of its proper divisors (1).
168228909822851 is an equidigital number, since it uses as much as digits as its factorization.
168228909822851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 159252480, while the sum is 71.
The spelling of 168228909822851 in words is "one hundred sixty-eight trillion, two hundred twenty-eight billion, nine hundred nine million, eight hundred twenty-two thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •