Base | Representation |
---|---|
bin | 1001100111000101100… |
… | …1000100110101010010 |
3 | 120210011212202202222212 |
4 | 2121301121010311102 |
5 | 10201121423443200 |
6 | 203503453032122 |
7 | 14633415445541 |
oct | 2316131046522 |
9 | 523155682885 |
10 | 165111156050 |
11 | 64028a41375 |
12 | 27bbb485642 |
13 | 12754146b09 |
14 | 7dc466c158 |
15 | 446554e035 |
hex | 2671644d52 |
165111156050 has 24 divisors (see below), whose sum is σ = 307118103600. Its totient is φ = 66042020880.
The previous prime is 165111156037. The next prime is 165111156059. The reversal of 165111156050 is 50651111561.
It is a junction number, because it is equal to n+sod(n) for n = 165111155998 and 165111156016.
It is not an unprimeable number, because it can be changed into a prime (165111156059) 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 11 ways as a sum of consecutive naturals, for example, 1982141 + ... + 2063759.
It is an arithmetic number, because the mean of its divisors is an integer number (12796587650).
Almost surely, 2165111156050 is an apocalyptic number.
165111156050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
165111156050 is a deficient number, since it is larger than the sum of its proper divisors (142006947550).
165111156050 is a wasteful number, since it uses less digits than its factorization.
165111156050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122090 (or 122085 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 32.
The spelling of 165111156050 in words is "one hundred sixty-five billion, one hundred eleven million, one hundred fifty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •