Base | Representation |
---|---|
bin | 10011101000100… |
… | …11110010000101 |
3 | 102110221000011100 |
4 | 21310103302011 |
5 | 314131114321 |
6 | 24202130313 |
7 | 4036663452 |
oct | 1164236205 |
9 | 373830140 |
10 | 164707461 |
11 | 84a78176 |
12 | 471b0999 |
13 | 2817b349 |
14 | 17c36829 |
15 | e6d7326 |
hex | 9d13c85 |
164707461 has 12 divisors (see below), whose sum is σ = 244341292. Its totient is φ = 106837056.
The previous prime is 164707429. The next prime is 164707481.
164707461 is a `hidden beast` number, since 1 + 647 + 0 + 7 + 4 + 6 + 1 = 666.
164707461 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 149450625 + 15256836 = 12225^2 + 3906^2 .
It is not a de Polignac number, because 164707461 - 25 = 164707429 is a prime.
It is a super-3 number, since 3×1647074613 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164707421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 246976 + ... + 247641.
Almost surely, 2164707461 is an apocalyptic number.
It is an amenable number.
164707461 is a deficient number, since it is larger than the sum of its proper divisors (79633831).
164707461 is a wasteful number, since it uses less digits than its factorization.
164707461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494660 (or 494657 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 36.
The square root of 164707461 is about 12833.8404618415. The cubic root of 164707461 is about 548.1563180693.
The spelling of 164707461 in words is "one hundred sixty-four million, seven hundred seven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •