Base | Representation |
---|---|
bin | 1111100000111100001001 |
3 | 21122121222122 |
4 | 33200330021 |
5 | 2020121311 |
6 | 223101025 |
7 | 46366244 |
oct | 17407411 |
9 | 7577878 |
10 | 4067081 |
11 | 2328727 |
12 | 1441775 |
13 | ac5275 |
14 | 77c25b |
15 | 5550db |
hex | 3e0f09 |
4067081 has 2 divisors, whose sum is σ = 4067082. Its totient is φ = 4067080.
The previous prime is 4067071. The next prime is 4067087. The reversal of 4067081 is 1807604.
4067081 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., 4000000 + 67081 = 2000^2 + 259^2 .
It is a cyclic number.
It is not a de Polignac number, because 4067081 - 218 = 3804937 is a prime.
It is a super-2 number, since 2×40670812 = 33082295721122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 4067081.
It is not a weakly prime, because it can be changed into another prime (4067087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2033540 + 2033541.
It is an arithmetic number, because the mean of its divisors is an integer number (2033541).
Almost surely, 24067081 is an apocalyptic number.
It is an amenable number.
4067081 is a deficient number, since it is larger than the sum of its proper divisors (1).
4067081 is an equidigital number, since it uses as much as digits as its factorization.
4067081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 26.
The square root of 4067081 is about 2016.7005231318. The cubic root of 4067081 is about 159.6225608440.
The spelling of 4067081 in words is "four million, sixty-seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •