Base | Representation |
---|---|
bin | 1000001000111101111000… |
… | …0001101110010000111001 |
3 | 1011200121212202221110100221 |
4 | 2002033132001232100321 |
5 | 2133114342304334121 |
6 | 31011345521500041 |
7 | 1612424600445121 |
oct | 202173601562071 |
9 | 34617782843327 |
10 | 8950141871161 |
11 | 2940808835a77 |
12 | 10067204a1621 |
13 | 4cbcc1633bca |
14 | 22d291165c81 |
15 | 107c3150cb41 |
hex | 823de06e439 |
8950141871161 has 2 divisors, whose sum is σ = 8950141871162. Its totient is φ = 8950141871160.
The previous prime is 8950141871129. The next prime is 8950141871171. The reversal of 8950141871161 is 1611781410598.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7362642669561 + 1587499201600 = 2713419^2 + 1259960^2 .
It is a cyclic number.
It is not a de Polignac number, because 8950141871161 - 25 = 8950141871129 is a prime.
It is a super-3 number, since 3×89501418711613 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 8950141871099 and 8950141871108.
It is not a weakly prime, because it can be changed into another prime (8950141871171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4475070935580 + 4475070935581.
It is an arithmetic number, because the mean of its divisors is an integer number (4475070935581).
Almost surely, 28950141871161 is an apocalyptic number.
It is an amenable number.
8950141871161 is a deficient number, since it is larger than the sum of its proper divisors (1).
8950141871161 is an equidigital number, since it uses as much as digits as its factorization.
8950141871161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 483840, while the sum is 52.
The spelling of 8950141871161 in words is "eight trillion, nine hundred fifty billion, one hundred forty-one million, eight hundred seventy-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •