Base | Representation |
---|---|
bin | 10011101011010… |
… | …00110010000000 |
3 | 102111120200201222 |
4 | 21311220302000 |
5 | 314223234431 |
6 | 24213414212 |
7 | 4042643465 |
oct | 1165506200 |
9 | 374520658 |
10 | 165055616 |
11 | 85195800 |
12 | 4733a368 |
13 | 2827095b |
14 | 17cc766c |
15 | e75557b |
hex | 9d68c80 |
165055616 has 48 divisors (see below), whose sum is σ = 361466070. Its totient is φ = 75018240.
The previous prime is 165055607. The next prime is 165055633. The reversal of 165055616 is 616550561.
It can be written as a sum of positive squares in only one way, i.e., 162817600 + 2238016 = 12760^2 + 1496^2 .
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 10160 + ... + 20816.
Almost surely, 2165055616 is an apocalyptic number.
165055616 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 165055616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180733035).
165055616 is an abundant number, since it is smaller than the sum of its proper divisors (196410454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
165055616 is a wasteful number, since it uses less digits than its factorization.
165055616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10693 (or 10670 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 35.
The square root of 165055616 is about 12847.3972461351. The cubic root of 165055616 is about 548.5422731694.
The spelling of 165055616 in words is "one hundred sixty-five million, fifty-five thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •