Base | Representation |
---|---|
bin | 1000110100010001101101… |
… | …0111100100110101011101 |
3 | 1021022202102111020120210221 |
4 | 2031010123113210311131 |
5 | 2232312210242231333 |
6 | 32341242033201341 |
7 | 2020245215255305 |
oct | 215043327446535 |
9 | 37282374216727 |
10 | 9694200352093 |
11 | 30a831840a484 |
12 | 1106974100251 |
13 | 55420b90c4ba |
14 | 2572b7a52605 |
15 | 11c27d524d2d |
hex | 8d11b5e4d5d |
9694200352093 has 2 divisors, whose sum is σ = 9694200352094. Its totient is φ = 9694200352092.
The previous prime is 9694200352051. The next prime is 9694200352157. The reversal of 9694200352093 is 3902530024969.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8627396441049 + 1066803911044 = 2937243^2 + 1032862^2 .
It is a cyclic number.
It is not a de Polignac number, because 9694200352093 - 225 = 9694166797661 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 9694200352093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9694200352013) 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 as a sum of consecutive naturals, namely, 4847100176046 + 4847100176047.
It is an arithmetic number, because the mean of its divisors is an integer number (4847100176047).
Almost surely, 29694200352093 is an apocalyptic number.
It is an amenable number.
9694200352093 is a deficient number, since it is larger than the sum of its proper divisors (1).
9694200352093 is an equidigital number, since it uses as much as digits as its factorization.
9694200352093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3149280, while the sum is 52.
The spelling of 9694200352093 in words is "nine trillion, six hundred ninety-four billion, two hundred million, three hundred fifty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •