Base | Representation |
---|---|
bin | 1001100101001010010… |
… | …1000010000100000000 |
3 | 120201211212000112010121 |
4 | 2121102211002010000 |
5 | 10144042103243421 |
6 | 203340304510024 |
7 | 14614540405534 |
oct | 2312245020400 |
9 | 521755015117 |
10 | 164594196736 |
11 | 63893151172 |
12 | 27a9631b314 |
13 | 126a1004628 |
14 | 7d75b3dbc4 |
15 | 4434e85d41 |
hex | 2652942100 |
164594196736 has 36 divisors (see below), whose sum is σ = 329476351932. Its totient is φ = 82063917056.
The previous prime is 164594196691. The next prime is 164594196737. The reversal of 164594196736 is 637691495461.
It can be written as a sum of positive squares in 2 ways, for example, as 114883035136 + 49711161600 = 338944^2 + 222960^2 .
It is not an unprimeable number, because it can be changed into a prime (164594196737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 820321 + ... + 1001056.
It is an arithmetic number, because the mean of its divisors is an integer number (9152120887).
Almost surely, 2164594196736 is an apocalyptic number.
164594196736 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
164594196736 is an abundant number, since it is smaller than the sum of its proper divisors (164882155196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164594196736 is an equidigital number, since it uses as much as digits as its factorization.
164594196736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1821746 (or 1821732 counting only the distinct ones).
The product of its digits is 29393280, while the sum is 61.
The spelling of 164594196736 in words is "one hundred sixty-four billion, five hundred ninety-four million, one hundred ninety-six thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •