Base | Representation |
---|---|
bin | 10011100110011… |
… | …10100110111110 |
3 | 102110101121111110 |
4 | 21303032212332 |
5 | 314043033001 |
6 | 24152102450 |
7 | 4034403426 |
oct | 1163164676 |
9 | 373347443 |
10 | 164424126 |
11 | 848a4309 |
12 | 47094a26 |
13 | 280ac3a9 |
14 | 17ba1486 |
15 | e67d3d6 |
hex | 9cce9be |
164424126 has 32 divisors (see below), whose sum is σ = 337696128. Its totient is φ = 53349920.
The previous prime is 164424103. The next prime is 164424149. The reversal of 164424126 is 621424461.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (164424103) and next prime (164424149).
It is a super-3 number, since 3×1644241263 (a number of 26 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 164424093 and 164424102.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 39685 + ... + 43631.
It is an arithmetic number, because the mean of its divisors is an integer number (10553004).
Almost surely, 2164424126 is an apocalyptic number.
164424126 is an abundant number, since it is smaller than the sum of its proper divisors (173272002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164424126 is a wasteful number, since it uses less digits than its factorization.
164424126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4136.
The product of its digits is 9216, while the sum is 30.
The square root of 164424126 is about 12822.7971207533. The cubic root of 164424126 is about 547.8418190335.
Adding to 164424126 its reverse (621424461), we get a palindrome (785848587).
The spelling of 164424126 in words is "one hundred sixty-four million, four hundred twenty-four thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •