Base | Representation |
---|---|
bin | 10011100110010… |
… | …10111100011111 |
3 | 102110100211220122 |
4 | 21303022330133 |
5 | 314042042434 |
6 | 24151505155 |
7 | 4034311610 |
oct | 1163127437 |
9 | 373324818 |
10 | 164409119 |
11 | 84894006 |
12 | 470881bb |
13 | 280a5604 |
14 | 17b99c07 |
15 | e678c2e |
hex | 9ccaf1f |
164409119 has 4 divisors (see below), whose sum is σ = 187896144. Its totient is φ = 140922096.
The previous prime is 164409103. The next prime is 164409121. The reversal of 164409119 is 911904461.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 911904461 = 13 ⋅70146497.
It is not a de Polignac number, because 164409119 - 24 = 164409103 is a prime.
It is a super-3 number, since 3×1644091193 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164409319) 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 3 ways as a sum of consecutive naturals, for example, 11743502 + ... + 11743515.
It is an arithmetic number, because the mean of its divisors is an integer number (46974036).
Almost surely, 2164409119 is an apocalyptic number.
164409119 is a deficient number, since it is larger than the sum of its proper divisors (23487025).
164409119 is an equidigital number, since it uses as much as digits as its factorization.
164409119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23487024.
The product of its (nonzero) digits is 7776, while the sum is 35.
The square root of 164409119 is about 12822.2119386633. The cubic root of 164409119 is about 547.8251513410.
The spelling of 164409119 in words is "one hundred sixty-four million, four hundred nine thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •