Base | Representation |
---|---|
bin | 1000011011001… |
… | …00011011010101 |
3 | 11220222012110002 |
4 | 10031210123111 |
5 | 121042302231 |
6 | 11002341045 |
7 | 1515436103 |
oct | 415443325 |
9 | 156865402 |
10 | 70665941 |
11 | 36986405 |
12 | 1b7ba785 |
13 | 11842988 |
14 | 9556c73 |
15 | 630d0cb |
hex | 43646d5 |
70665941 has 2 divisors, whose sum is σ = 70665942. Its totient is φ = 70665940.
The previous prime is 70665853. The next prime is 70665943. The reversal of 70665941 is 14956607.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48302500 + 22363441 = 6950^2 + 4729^2 .
It is an emirp because it is prime and its reverse (14956607) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 70665941 - 222 = 66471637 is a prime.
Together with 70665943, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 70665895 and 70665904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (70665943) 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, 35332970 + 35332971.
It is an arithmetic number, because the mean of its divisors is an integer number (35332971).
Almost surely, 270665941 is an apocalyptic number.
It is an amenable number.
70665941 is a deficient number, since it is larger than the sum of its proper divisors (1).
70665941 is an equidigital number, since it uses as much as digits as its factorization.
70665941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 38.
The square root of 70665941 is about 8406.3036466690. The cubic root of 70665941 is about 413.4313277163.
The spelling of 70665941 in words is "seventy million, six hundred sixty-five thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •