Base | Representation |
---|---|
bin | 1000011111110100001101… |
… | …0111110100000111101101 |
3 | 1020002011002201120010021202 |
4 | 2013331003113310013231 |
5 | 2211032304122410234 |
6 | 31511545253535245 |
7 | 1652662265166104 |
oct | 207750327640755 |
9 | 36064081503252 |
10 | 9342684185069 |
11 | 2a82234728434 |
12 | 106a812044525 |
13 | 52a01bbab031 |
14 | 24428caad03b |
15 | 11305833177e |
hex | 87f435f41ed |
9342684185069 has 2 divisors, whose sum is σ = 9342684185070. Its totient is φ = 9342684185068.
The previous prime is 9342684185017. The next prime is 9342684185077. The reversal of 9342684185069 is 9605814862439.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9342008860900 + 675324169 = 3056470^2 + 25987^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9342684185069 is a prime.
It is a super-2 number, since 2×93426841850692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 9342684184996 and 9342684185014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9342684185089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4671342092534 + 4671342092535.
It is an arithmetic number, because the mean of its divisors is an integer number (4671342092535).
Almost surely, 29342684185069 is an apocalyptic number.
It is an amenable number.
9342684185069 is a deficient number, since it is larger than the sum of its proper divisors (1).
9342684185069 is an equidigital number, since it uses as much as digits as its factorization.
9342684185069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 89579520, while the sum is 65.
The spelling of 9342684185069 in words is "nine trillion, three hundred forty-two billion, six hundred eighty-four million, one hundred eighty-five thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •