Base | Representation |
---|---|
bin | 10011000101001… |
… | …11101100001101 |
3 | 102011012102022211 |
4 | 21202213230031 |
5 | 311434223123 |
6 | 23514510421 |
7 | 3652401406 |
oct | 1142475415 |
9 | 364172284 |
10 | 160070413 |
11 | 823a02a8 |
12 | 45735411 |
13 | 27216829 |
14 | 1738a9ad |
15 | e0bd40d |
hex | 98a7b0d |
160070413 has 2 divisors, whose sum is σ = 160070414. Its totient is φ = 160070412.
The previous prime is 160070377. The next prime is 160070431. The reversal of 160070413 is 314070061.
160070413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (160070431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103489929 + 56580484 = 10173^2 + 7522^2 .
It is an emirp because it is prime and its reverse (314070061) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 160070413 - 225 = 126515981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (160070483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80035206 + 80035207.
It is an arithmetic number, because the mean of its divisors is an integer number (80035207).
Almost surely, 2160070413 is an apocalyptic number.
It is an amenable number.
160070413 is a deficient number, since it is larger than the sum of its proper divisors (1).
160070413 is an equidigital number, since it uses as much as digits as its factorization.
160070413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 160070413 is about 12651.8936527304. The cubic root of 160070413 is about 542.9631492593.
The spelling of 160070413 in words is "one hundred sixty million, seventy thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •