Base | Representation |
---|---|
bin | 1001011001010110100… |
… | …0100100011011100001 |
3 | 120102122221011112102101 |
4 | 2112111220210123201 |
5 | 10121044100330423 |
6 | 202053545250401 |
7 | 14443146213406 |
oct | 2262550443341 |
9 | 512587145371 |
10 | 161424230113 |
11 | 62506851343 |
12 | 27350793a01 |
13 | 122b7350033 |
14 | 7b54b322ad |
15 | 42eba1b7ad |
hex | 2595a246e1 |
161424230113 has 2 divisors, whose sum is σ = 161424230114. Its totient is φ = 161424230112.
The previous prime is 161424230087. The next prime is 161424230179. The reversal of 161424230113 is 311032424161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 137887454224 + 23536775889 = 371332^2 + 153417^2 .
It is an emirp because it is prime and its reverse (311032424161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 161424230113 - 213 = 161424221921 is a prime.
It is not a weakly prime, because it can be changed into another prime (161424237113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80712115056 + 80712115057.
It is an arithmetic number, because the mean of its divisors is an integer number (80712115057).
Almost surely, 2161424230113 is an apocalyptic number.
It is an amenable number.
161424230113 is a deficient number, since it is larger than the sum of its proper divisors (1).
161424230113 is an equidigital number, since it uses as much as digits as its factorization.
161424230113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 161424230113 its reverse (311032424161), we get a palindrome (472456654274).
The spelling of 161424230113 in words is "one hundred sixty-one billion, four hundred twenty-four million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •