Base | Representation |
---|---|
bin | 1111011111111101… |
… | …0100010100111001 |
3 | 101201221211220000102 |
4 | 3313333110110321 |
5 | 32010101230211 |
6 | 1524503245145 |
7 | 205050160451 |
oct | 36777242471 |
9 | 11657756012 |
10 | 4160570681 |
11 | 1845596373 |
12 | 9814497b5 |
13 | 513c81b57 |
14 | 2b67d0d61 |
15 | 1953e1a3b |
hex | f7fd4539 |
4160570681 has 2 divisors, whose sum is σ = 4160570682. Its totient is φ = 4160570680.
The previous prime is 4160570647. The next prime is 4160570749. The reversal of 4160570681 is 1860750614.
4160570681 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3980474281 + 180096400 = 63091^2 + 13420^2 .
It is a cyclic number.
It is not a de Polignac number, because 4160570681 - 214 = 4160554297 is a prime.
It is a super-2 number, since 2×41605706812 = 34620696783193607522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (4160570641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2080285340 + 2080285341.
It is an arithmetic number, because the mean of its divisors is an integer number (2080285341).
Almost surely, 24160570681 is an apocalyptic number.
It is an amenable number.
4160570681 is a deficient number, since it is larger than the sum of its proper divisors (1).
4160570681 is an equidigital number, since it uses as much as digits as its factorization.
4160570681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 4160570681 is about 64502.4858513220. The cubic root of 4160570681 is about 1608.3638433997.
The spelling of 4160570681 in words is "four billion, one hundred sixty million, five hundred seventy thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •