Base | Representation |
---|---|
bin | 10011001010001… |
… | …00100110101011 |
3 | 102012102001222012 |
4 | 21211010212223 |
5 | 312120310011 |
6 | 23540350135 |
7 | 3661016255 |
oct | 1145044653 |
9 | 365361865 |
10 | 160713131 |
11 | 8279a177 |
12 | 459a534b |
13 | 273b0237 |
14 | 174b6cd5 |
15 | e198a8b |
hex | 99449ab |
160713131 has 2 divisors, whose sum is σ = 160713132. Its totient is φ = 160713130.
The previous prime is 160713127. The next prime is 160713169. The reversal of 160713131 is 131317061.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 160713131 - 22 = 160713127 is a prime.
It is a super-2 number, since 2×1607131312 = 51657420951646322, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 160713097 and 160713106.
It is not a weakly prime, because it can be changed into another prime (160713431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80356565 + 80356566.
It is an arithmetic number, because the mean of its divisors is an integer number (80356566).
Almost surely, 2160713131 is an apocalyptic number.
160713131 is a deficient number, since it is larger than the sum of its proper divisors (1).
160713131 is an equidigital number, since it uses as much as digits as its factorization.
160713131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 378, while the sum is 23.
The square root of 160713131 is about 12677.2682783003. The cubic root of 160713131 is about 543.6888843805.
The spelling of 160713131 in words is "one hundred sixty million, seven hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •