Base | Representation |
---|---|
bin | 1001100011111101011… |
… | …1110110101000000101 |
3 | 120201000101200221220011 |
4 | 2120333113312220011 |
5 | 10142412111144132 |
6 | 203244314310221 |
7 | 14603545514401 |
oct | 2307727665005 |
9 | 521011627804 |
10 | 164271974917 |
11 | 6373827a146 |
12 | 27a06428371 |
13 | 1264c32602b |
14 | 7d45024101 |
15 | 4416a37b47 |
hex | 263f5f6a05 |
164271974917 has 4 divisors (see below), whose sum is σ = 171414234720. Its totient is φ = 157129715116.
The previous prime is 164271974869. The next prime is 164271974957. The reversal of 164271974917 is 719479172461.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-164271974917 is a prime.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164271974957) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3571129867 + ... + 3571129912.
It is an arithmetic number, because the mean of its divisors is an integer number (42853558680).
Almost surely, 2164271974917 is an apocalyptic number.
It is an amenable number.
164271974917 is a deficient number, since it is larger than the sum of its proper divisors (7142259803).
164271974917 is an equidigital number, since it uses as much as digits as its factorization.
164271974917 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7142259802.
The product of its digits is 5334336, while the sum is 58.
The spelling of 164271974917 in words is "one hundred sixty-four billion, two hundred seventy-one million, nine hundred seventy-four thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •