Base | Representation |
---|---|
bin | 100110001111000110010010… |
… | …010000111101101001010110 |
3 | 211001102020220002202210220001 |
4 | 212033012102100331221112 |
5 | 134020141423431220010 |
6 | 1353353054000201514 |
7 | 50264253356254240 |
oct | 4617062220755126 |
9 | 731366802683801 |
10 | 168163308460630 |
11 | 4964472768805a |
12 | 16a3b21390929a |
13 | 72aa96910a4c2 |
14 | 2d7520cc7b090 |
15 | 14694a8449c3a |
hex | 98f19243da56 |
168163308460630 has 128 divisors (see below), whose sum is σ = 347240234880000. Its totient is φ = 57439152760320.
The previous prime is 168163308460627. The next prime is 168163308460633. The reversal of 168163308460630 is 36064803361861.
It is an interprime number because it is at equal distance from previous prime (168163308460627) and next prime (168163308460633).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (168163308460633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 80115915321 + ... + 80115917419.
It is an arithmetic number, because the mean of its divisors is an integer number (2712814335000).
Almost surely, 2168163308460630 is an apocalyptic number.
168163308460630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
168163308460630 is an abundant number, since it is smaller than the sum of its proper divisors (179076926419370).
168163308460630 is a wasteful number, since it uses less digits than its factorization.
168163308460630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5702.
The product of its (nonzero) digits is 8957952, while the sum is 55.
The spelling of 168163308460630 in words is "one hundred sixty-eight trillion, one hundred sixty-three billion, three hundred eight million, four hundred sixty thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •