Base | Representation |
---|---|
bin | 10011101011001… |
… | …11011011001101 |
3 | 102111120102010020 |
4 | 21311213123031 |
5 | 314223100221 |
6 | 24213332353 |
7 | 4042621341 |
oct | 1165473315 |
9 | 374512106 |
10 | 165050061 |
11 | 85191610 |
12 | 473370b9 |
13 | 2826b277 |
14 | 17cc5621 |
15 | e753ac6 |
hex | 9d676cd |
165050061 has 16 divisors (see below), whose sum is σ = 240978240. Its totient is φ = 99653120.
The previous prime is 165050057. The next prime is 165050063. The reversal of 165050061 is 160050561.
It is a cyclic number.
It is not a de Polignac number, because 165050061 - 22 = 165050057 is a prime.
It is a super-2 number, since 2×1650500612 = 54483045272207442, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165050063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 420 + ... + 18173.
It is an arithmetic number, because the mean of its divisors is an integer number (15061140).
Almost surely, 2165050061 is an apocalyptic number.
165050061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
165050061 is a deficient number, since it is larger than the sum of its proper divisors (75928179).
165050061 is a wasteful number, since it uses less digits than its factorization.
165050061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18876.
The product of its (nonzero) digits is 900, while the sum is 24.
The square root of 165050061 is about 12847.1810526668. The cubic root of 165050061 is about 548.5361193113.
It can be divided in two parts, 1650500 and 61, that added together give a palindrome (1650561).
The spelling of 165050061 in words is "one hundred sixty-five million, fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •