Base | Representation |
---|---|
bin | 1001100100000101000… |
… | …1000100101001000110 |
3 | 120201002121111101111220 |
4 | 2121001101010221012 |
5 | 10142443230024000 |
6 | 203251411341210 |
7 | 14604412563255 |
oct | 2310121045106 |
9 | 521077441456 |
10 | 164303751750 |
11 | 63754203596 |
12 | 27a14bb1806 |
13 | 12655aa09a8 |
14 | 7d4933679c |
15 | 44197131a0 |
hex | 2641444a46 |
164303751750 has 64 divisors (see below), whose sum is σ = 410361951168. Its totient is φ = 43786579200.
The previous prime is 164303751749. The next prime is 164303751793. The reversal of 164303751750 is 57157303461.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1129162 + ... + 1266338.
It is an arithmetic number, because the mean of its divisors is an integer number (6411905487).
Almost surely, 2164303751750 is an apocalyptic number.
164303751750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 164303751750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205180975584).
164303751750 is an abundant number, since it is smaller than the sum of its proper divisors (246058199418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164303751750 is a wasteful number, since it uses less digits than its factorization.
164303751750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138794 (or 138784 counting only the distinct ones).
The product of its (nonzero) digits is 264600, while the sum is 42.
The spelling of 164303751750 in words is "one hundred sixty-four billion, three hundred three million, seven hundred fifty-one thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •