Base | Representation |
---|---|
bin | 10011100011110… |
… | …01111010111001 |
3 | 102102201222122212 |
4 | 21301321322321 |
5 | 314000432431 |
6 | 24140424505 |
7 | 4031430206 |
oct | 1161717271 |
9 | 372658585 |
10 | 164077241 |
11 | 84687729 |
12 | 46b48135 |
13 | 27cba533 |
14 | 17b10cad |
15 | e61072b |
hex | 9c79eb9 |
164077241 has 4 divisors (see below), whose sum is σ = 167173092. Its totient is φ = 160981392.
The previous prime is 164077231. The next prime is 164077253. The reversal of 164077241 is 142770461.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 128029225 + 36048016 = 11315^2 + 6004^2 .
It is a cyclic number.
It is not a de Polignac number, because 164077241 - 218 = 163815097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 164077198 and 164077207.
It is not an unprimeable number, because it can be changed into a prime (164077201) 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, 1547846 + ... + 1547951.
It is an arithmetic number, because the mean of its divisors is an integer number (41793273).
Almost surely, 2164077241 is an apocalyptic number.
It is an amenable number.
164077241 is a deficient number, since it is larger than the sum of its proper divisors (3095851).
164077241 is an equidigital number, since it uses as much as digits as its factorization.
164077241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3095850.
The product of its (nonzero) digits is 9408, while the sum is 32.
The square root of 164077241 is about 12809.2638742435. The cubic root of 164077241 is about 547.4562878024.
The spelling of 164077241 in words is "one hundred sixty-four million, seventy-seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •