Base | Representation |
---|---|
bin | 1001110010011011100… |
… | …1110100000001100010 |
3 | 121002001002221220122012 |
4 | 2130212321310001202 |
5 | 10223341020222200 |
6 | 205125555312522 |
7 | 15102033636002 |
oct | 2344671640142 |
9 | 532032856565 |
10 | 168156414050 |
11 | 65350a03819 |
12 | 2870b2ab742 |
13 | 12b1b016221 |
14 | 81d2c96002 |
15 | 4592a82a35 |
hex | 2726e74062 |
168156414050 has 24 divisors (see below), whose sum is σ = 312820875876. Its totient is φ = 67251824640.
The previous prime is 168156414047. The next prime is 168156414163. The reversal of 168156414050 is 50414651861.
It can be written as a sum of positive squares in 6 ways, for example, as 106855110769 + 61301303281 = 326887^2 + 247591^2 .
It is a junction number, because it is equal to n+sod(n) for n = 168156413989 and 168156414007.
It is an unprimeable number.
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, 51494 + ... + 582206.
Almost surely, 2168156414050 is an apocalyptic number.
168156414050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
168156414050 is a deficient number, since it is larger than the sum of its proper divisors (144664461826).
168156414050 is a wasteful number, since it uses less digits than its factorization.
168156414050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537062 (or 537057 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 41.
The spelling of 168156414050 in words is "one hundred sixty-eight billion, one hundred fifty-six million, four hundred fourteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •