Base | Representation |
---|---|
bin | 1001110101001110111… |
… | …1101111110011011001 |
3 | 121010222112121112121011 |
4 | 2131103233233303121 |
5 | 10231411120000131 |
6 | 205332352413521 |
7 | 15126500454253 |
oct | 2352357576331 |
9 | 533875545534 |
10 | 168908750041 |
11 | 656a76499a9 |
12 | 2889b2472a1 |
13 | 12c0ab4b055 |
14 | 8264b74cd3 |
15 | 45d8b420b1 |
hex | 2753befcd9 |
168908750041 has 4 divisors (see below), whose sum is σ = 168909594084. Its totient is φ = 168907906000.
The previous prime is 168908750029. The next prime is 168908750057. The reversal of 168908750041 is 140057809861.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 140057809861 = 701 ⋅199797161.
It can be written as a sum of positive squares in 2 ways, for example, as 125242378816 + 43666371225 = 353896^2 + 208965^2 .
It is a cyclic number.
It is not a de Polignac number, because 168908750041 - 211 = 168908747993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (168908750141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67191 + ... + 585091.
It is an arithmetic number, because the mean of its divisors is an integer number (42227398521).
Almost surely, 2168908750041 is an apocalyptic number.
It is an amenable number.
168908750041 is a deficient number, since it is larger than the sum of its proper divisors (844043).
168908750041 is an equidigital number, since it uses as much as digits as its factorization.
168908750041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 844042.
The product of its (nonzero) digits is 483840, while the sum is 49.
The spelling of 168908750041 in words is "one hundred sixty-eight billion, nine hundred eight million, seven hundred fifty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •