Base | Representation |
---|---|
bin | 1000011001110… |
… | …10111110001101 |
3 | 11220122120112012 |
4 | 10030322332031 |
5 | 121021334031 |
6 | 10554551005 |
7 | 1514131052 |
oct | 414727615 |
9 | 156576465 |
10 | 70496141 |
11 | 3687a881 |
12 | 1b738465 |
13 | 117b35c1 |
14 | 9511029 |
15 | 62c7b2b |
hex | 433af8d |
70496141 has 2 divisors, whose sum is σ = 70496142. Its totient is φ = 70496140.
The previous prime is 70496123. The next prime is 70496147. The reversal of 70496141 is 14169407.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70073641 + 422500 = 8371^2 + 650^2 .
It is a cyclic number.
It is not a de Polignac number, because 70496141 - 214 = 70479757 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 70496098 and 70496107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (70496147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35248070 + 35248071.
It is an arithmetic number, because the mean of its divisors is an integer number (35248071).
Almost surely, 270496141 is an apocalyptic number.
It is an amenable number.
70496141 is a deficient number, since it is larger than the sum of its proper divisors (1).
70496141 is an equidigital number, since it uses as much as digits as its factorization.
70496141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 32.
The square root of 70496141 is about 8396.1980086227. The cubic root of 70496141 is about 413.0999236436.
The spelling of 70496141 in words is "seventy million, four hundred ninety-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •