Base | Representation |
---|---|
bin | 1111100000001110101001 |
3 | 21122110222210 |
4 | 33200032221 |
5 | 2020023134 |
6 | 223035333 |
7 | 46354614 |
oct | 17401651 |
9 | 7573883 |
10 | 4064169 |
11 | 232651a |
12 | 143bb49 |
13 | ac3b45 |
14 | 77b17b |
15 | 5542e9 |
hex | 3e03a9 |
4064169 has 8 divisors (see below), whose sum is σ = 5654592. Its totient is φ = 2591600.
The previous prime is 4064167. The next prime is 4064171. The reversal of 4064169 is 9614604.
4064169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (4064167) and next prime (4064171).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4064169 - 21 = 4064167 is a prime.
It is a super-2 number, since 2×40641692 = 33034939321122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4064161) 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 in 7 ways as a sum of consecutive naturals, for example, 29382 + ... + 29519.
It is an arithmetic number, because the mean of its divisors is an integer number (706824).
Almost surely, 24064169 is an apocalyptic number.
It is an amenable number.
4064169 is a deficient number, since it is larger than the sum of its proper divisors (1590423).
4064169 is a wasteful number, since it uses less digits than its factorization.
4064169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58927.
The product of its (nonzero) digits is 5184, while the sum is 30.
The square root of 4064169 is about 2015.9784225036. The cubic root of 4064169 is about 159.5844555561.
The spelling of 4064169 in words is "four million, sixty-four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •