Base | Representation |
---|---|
bin | 10011100110011… |
… | …11010010111101 |
3 | 102110101202100201 |
4 | 21303033102331 |
5 | 314043130231 |
6 | 24152123501 |
7 | 4034414560 |
oct | 1163172275 |
9 | 373352321 |
10 | 164426941 |
11 | 848a6438 |
12 | 47096591 |
13 | 280b0763 |
14 | 17ba24d7 |
15 | e67e161 |
hex | 9ccf4bd |
164426941 has 8 divisors (see below), whose sum is σ = 198970560. Its totient is φ = 132646848.
The previous prime is 164426939. The next prime is 164426947. The reversal of 164426941 is 149624461.
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 164426941 - 21 = 164426939 is a prime.
It is a super-3 number, since 3×1644269413 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 164426941.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164426947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 690751 + ... + 690988.
It is an arithmetic number, because the mean of its divisors is an integer number (24871320).
Almost surely, 2164426941 is an apocalyptic number.
It is an amenable number.
164426941 is a deficient number, since it is larger than the sum of its proper divisors (34543619).
164426941 is a wasteful number, since it uses less digits than its factorization.
164426941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1381763.
The product of its digits is 41472, while the sum is 37.
The square root of 164426941 is about 12822.9068857260. The cubic root of 164426941 is about 547.8449454318.
The spelling of 164426941 in words is "one hundred sixty-four million, four hundred twenty-six thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •