Base | Representation |
---|---|
bin | 111111110001101110001… |
… | …0001101011100010011101 |
3 | 1011000222002210220121112021 |
4 | 1333203130101223202131 |
5 | 2122103044244444031 |
6 | 30350441001540141 |
7 | 1563165333241165 |
oct | 177433421534235 |
9 | 34028083817467 |
10 | 8765428906141 |
11 | 287a441115486 |
12 | b969704a4651 |
13 | 4b776546c57b |
14 | 22436b4655a5 |
15 | 10302019a511 |
hex | 7f8dc46b89d |
8765428906141 has 2 divisors, whose sum is σ = 8765428906142. Its totient is φ = 8765428906140.
The previous prime is 8765428906079. The next prime is 8765428906163. The reversal of 8765428906141 is 1416098245678.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8757042192900 + 8386713241 = 2959230^2 + 91579^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-8765428906141 is a prime.
It is a super-2 number, since 2×87654289061412 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 8765428906141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8765498906141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4382714453070 + 4382714453071.
It is an arithmetic number, because the mean of its divisors is an integer number (4382714453071).
Almost surely, 28765428906141 is an apocalyptic number.
It is an amenable number.
8765428906141 is a deficient number, since it is larger than the sum of its proper divisors (1).
8765428906141 is an equidigital number, since it uses as much as digits as its factorization.
8765428906141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23224320, while the sum is 61.
The spelling of 8765428906141 in words is "eight trillion, seven hundred sixty-five billion, four hundred twenty-eight million, nine hundred six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •