Base | Representation |
---|---|
bin | 10011100110010… |
… | …10010101110001 |
3 | 102110100201111212 |
4 | 21303022111301 |
5 | 314042003031 |
6 | 24151445505 |
7 | 4034301440 |
oct | 1163122561 |
9 | 373321455 |
10 | 164406641 |
11 | 84892163 |
12 | 47086895 |
13 | 280a4449 |
14 | 17b98d57 |
15 | e67812b |
hex | 9cca571 |
164406641 has 8 divisors (see below), whose sum is σ = 188008704. Its totient is φ = 140833440.
The previous prime is 164406617. The next prime is 164406647. The reversal of 164406641 is 146604461.
164406641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-164406641 is a prime.
It is a super-3 number, since 3×1644066413 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 164406598 and 164406607.
It is not an unprimeable number, because it can be changed into a prime (164406647) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6821 + ... + 19373.
It is an arithmetic number, because the mean of its divisors is an integer number (23501088).
Almost surely, 2164406641 is an apocalyptic number.
It is an amenable number.
164406641 is a deficient number, since it is larger than the sum of its proper divisors (23602063).
164406641 is a wasteful number, since it uses less digits than its factorization.
164406641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14431.
The product of its (nonzero) digits is 13824, while the sum is 32.
The square root of 164406641 is about 12822.1153091056. The cubic root of 164406641 is about 547.8223990250.
The spelling of 164406641 in words is "one hundred sixty-four million, four hundred six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •