Base | Representation |
---|---|
bin | 10011001110100… |
… | …11111110111101 |
3 | 102020111220120101 |
4 | 21213103332331 |
5 | 312243103123 |
6 | 24001121101 |
7 | 3666013411 |
oct | 1147237675 |
9 | 366456511 |
10 | 161300413 |
11 | 8306042a |
12 | 46029191 |
13 | 27557641 |
14 | 175cad41 |
15 | e262aad |
hex | 99d3fbd |
161300413 has 2 divisors, whose sum is σ = 161300414. Its totient is φ = 161300412.
The previous prime is 161300411. The next prime is 161300417. The reversal of 161300413 is 314003161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 160326244 + 974169 = 12662^2 + 987^2 .
It is an emirp because it is prime and its reverse (314003161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 161300413 - 21 = 161300411 is a prime.
Together with 161300411, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161300411) 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, 80650206 + 80650207.
It is an arithmetic number, because the mean of its divisors is an integer number (80650207).
Almost surely, 2161300413 is an apocalyptic number.
It is an amenable number.
161300413 is a deficient number, since it is larger than the sum of its proper divisors (1).
161300413 is an equidigital number, since it uses as much as digits as its factorization.
161300413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 161300413 is about 12700.4099540133. The cubic root of 161300413 is about 544.3503332434.
Adding to 161300413 its reverse (314003161), we get a palindrome (475303574).
The spelling of 161300413 in words is "one hundred sixty-one million, three hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •