Base | Representation |
---|---|
bin | 100100100011110010010001… |
… | …110011100010101101011011 |
3 | 210002022021002211220121210121 |
4 | 210203302101303202231123 |
5 | 132033331022011312031 |
6 | 1325545212500454111 |
7 | 45603416251615561 |
oct | 4443622163425533 |
9 | 702267084817717 |
10 | 160788841900891 |
11 | 4726118a550a66 |
12 | 16049b559aa337 |
13 | 6b9442706cc99 |
14 | 2b9c315a07a31 |
15 | 138c747c96011 |
hex | 923c91ce2b5b |
160788841900891 has 2 divisors, whose sum is σ = 160788841900892. Its totient is φ = 160788841900890.
The previous prime is 160788841900889. The next prime is 160788841900949. The reversal of 160788841900891 is 198009148887061.
160788841900891 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 160788841900891 - 21 = 160788841900889 is a prime.
Together with 160788841900889, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 160788841900891.
It is not a weakly prime, because it can be changed into another prime (160788841900991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80394420950445 + 80394420950446.
It is an arithmetic number, because the mean of its divisors is an integer number (80394420950446).
Almost surely, 2160788841900891 is an apocalyptic number.
160788841900891 is a deficient number, since it is larger than the sum of its proper divisors (1).
160788841900891 is an equidigital number, since it uses as much as digits as its factorization.
160788841900891 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 55738368, while the sum is 70.
The spelling of 160788841900891 in words is "one hundred sixty trillion, seven hundred eighty-eight billion, eight hundred forty-one million, nine hundred thousand, eight hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •