Base | Representation |
---|---|
bin | 1001110010101101100… |
… | …0111000010001110011 |
3 | 121002020100120011000012 |
4 | 2130223120320101303 |
5 | 10224014301314203 |
6 | 205141244245135 |
7 | 15103636400534 |
oct | 2345330702163 |
9 | 532210504005 |
10 | 168231666803 |
11 | 6538a432282 |
12 | 287305407ab |
13 | 12b307a3895 |
14 | 81dcc8468b |
15 | 4599499bd8 |
hex | 272b638473 |
168231666803 has 8 divisors (see below), whose sum is σ = 169375713072. Its totient is φ = 167088538656.
The previous prime is 168231666677. The next prime is 168231666847. The reversal of 168231666803 is 308666132861.
168231666803 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 168231666803 - 210 = 168231665779 is a prime.
It is a super-2 number, since 2×1682316668032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (168231666403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 140201 + ... + 596757.
It is an arithmetic number, because the mean of its divisors is an integer number (21171964134).
Almost surely, 2168231666803 is an apocalyptic number.
168231666803 is a deficient number, since it is larger than the sum of its proper divisors (1144046269).
168231666803 is a wasteful number, since it uses less digits than its factorization.
168231666803 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459061.
The product of its (nonzero) digits is 1492992, while the sum is 50.
The spelling of 168231666803 in words is "one hundred sixty-eight billion, two hundred thirty-one million, six hundred sixty-six thousand, eight hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •