Base | Representation |
---|---|
bin | 100110001110001111011100… |
… | …110110110001101000000100 |
3 | 211001012121220210012121202222 |
4 | 212032033130312301220010 |
5 | 134013210333132012313 |
6 | 1353310035325551512 |
7 | 50260100331446504 |
oct | 4616173466615004 |
9 | 731177823177688 |
10 | 168104430344708 |
11 | 49621763502120 |
12 | 16a2b921715598 |
13 | 72a5244c23b60 |
14 | 2d724253c1a04 |
15 | 1467bae452208 |
hex | 98e3dcdb1a04 |
168104430344708 has 96 divisors (see below), whose sum is σ = 355389080884992. Its totient is φ = 68551353446400.
The previous prime is 168104430344707. The next prime is 168104430344731. The reversal of 168104430344708 is 807443034401861.
It is a self number, because there is not a number n which added to its sum of digits gives 168104430344708.
It is not an unprimeable number, because it can be changed into a prime (168104430344707) 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 31 ways as a sum of consecutive naturals, for example, 7459541 + ... + 19795292.
It is an arithmetic number, because the mean of its divisors is an integer number (3701969592552).
Almost surely, 2168104430344708 is an apocalyptic number.
It is an amenable number.
168104430344708 is an abundant number, since it is smaller than the sum of its proper divisors (187284650540284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168104430344708 is a wasteful number, since it uses less digits than its factorization.
168104430344708 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27255165 (or 27255163 counting only the distinct ones).
The product of its (nonzero) digits is 6193152, while the sum is 53.
The spelling of 168104430344708 in words is "one hundred sixty-eight trillion, one hundred four billion, four hundred thirty million, three hundred forty-four thousand, seven hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •