Base | Representation |
---|---|
bin | 1001100011101100000… |
… | …1001000101010111111 |
3 | 120200211022012220120101 |
4 | 2120323001020222333 |
5 | 10142234410120110 |
6 | 203233144301531 |
7 | 14602000466143 |
oct | 2307301105277 |
9 | 520738186511 |
10 | 164198910655 |
11 | 6370000595a |
12 | 279a5a718a7 |
13 | 1263a153840 |
14 | 7d39445223 |
15 | 441040413a |
hex | 263b048abf |
164198910655 has 16 divisors (see below), whose sum is σ = 213147083520. Its totient is φ = 120710827008.
The previous prime is 164198910647. The next prime is 164198910661. The reversal of 164198910655 is 556019891461.
It is a happy number.
164198910655 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 164198910655 - 23 = 164198910647 is a prime.
It is a super-2 number, since 2×1641989106552 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 164198910596 and 164198910605.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5649490 + ... + 5678479.
It is an arithmetic number, because the mean of its divisors is an integer number (13321692720).
Almost surely, 2164198910655 is an apocalyptic number.
164198910655 is a deficient number, since it is larger than the sum of its proper divisors (48948172865).
164198910655 is a wasteful number, since it uses less digits than its factorization.
164198910655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11328210.
The product of its (nonzero) digits is 2332800, while the sum is 55.
The spelling of 164198910655 in words is "one hundred sixty-four billion, one hundred ninety-eight million, nine hundred ten thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •