Base | Representation |
---|---|
bin | 100101011100110000101010… |
… | …101110101010000101101010 |
3 | 210121011120010111120002111202 |
4 | 211130300222232222011222 |
5 | 133042003020410203343 |
6 | 1342144010205124202 |
7 | 46456323462633023 |
oct | 4534605256520552 |
9 | 717146114502452 |
10 | 164704122741098 |
11 | 48530698506996 |
12 | 16580919559662 |
13 | 70b96bc124c65 |
14 | 2c95a17533c4a |
15 | 14094eb302db8 |
hex | 95cc2abaa16a |
164704122741098 has 4 divisors (see below), whose sum is σ = 247056184111650. Its totient is φ = 82352061370548.
The previous prime is 164704122741097. The next prime is 164704122741131. The reversal of 164704122741098 is 890147221407461.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 110114234822089 + 54589887919009 = 10493533^2 + 7388497^2 .
It is a super-3 number, since 3×1647041227410983 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (164704122741097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 41176030685273 + ... + 41176030685276.
Almost surely, 2164704122741098 is an apocalyptic number.
164704122741098 is a deficient number, since it is larger than the sum of its proper divisors (82352061370552).
164704122741098 is an equidigital number, since it uses as much as digits as its factorization.
164704122741098 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82352061370551.
The product of its (nonzero) digits is 5419008, while the sum is 56.
The spelling of 164704122741098 in words is "one hundred sixty-four trillion, seven hundred four billion, one hundred twenty-two million, seven hundred forty-one thousand, ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •