Base | Representation |
---|---|
bin | 111111110100010… |
… | …010001000011001 |
3 | 2202121122200121211 |
4 | 333310102020121 |
5 | 4143042422421 |
6 | 254124103121 |
7 | 35350355635 |
oct | 7764221031 |
9 | 2677580554 |
10 | 1070670361 |
11 | 4aa402542 |
12 | 25a694aa1 |
13 | 140a81b77 |
14 | a22a5dc5 |
15 | 63ee09e1 |
hex | 3fd12219 |
1070670361 has 2 divisors, whose sum is σ = 1070670362. Its totient is φ = 1070670360.
The previous prime is 1070670329. The next prime is 1070670379. The reversal of 1070670361 is 1630760701.
1070670361 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1036518025 + 34152336 = 32195^2 + 5844^2 .
It is an emirp because it is prime and its reverse (1630760701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1070670361 - 25 = 1070670329 is a prime.
It is a super-2 number, since 2×10706703612 = 2292670043847740642, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1070670301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 535335180 + 535335181.
It is an arithmetic number, because the mean of its divisors is an integer number (535335181).
Almost surely, 21070670361 is an apocalyptic number.
It is an amenable number.
1070670361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1070670361 is an equidigital number, since it uses as much as digits as its factorization.
1070670361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 31.
The square root of 1070670361 is about 32721.0996300552. The cubic root of 1070670361 is about 1023.0226757284.
The spelling of 1070670361 in words is "one billion, seventy million, six hundred seventy thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •