Base | Representation |
---|---|
bin | 10101011000101010010001… |
… | …001101111010001110011101 |
3 | 110100000102212012102221012002 |
4 | 111120222101031322032131 |
5 | 44311433313312043433 |
6 | 532011350300452045 |
7 | 25545102430546421 |
oct | 2530522115721635 |
9 | 410012765387162 |
10 | 94053630190493 |
11 | 27a71a142a6706 |
12 | a67028254a025 |
13 | 40632b097689c |
14 | 1932311920b81 |
15 | ad183dc539e8 |
hex | 558a9137a39d |
94053630190493 has 2 divisors, whose sum is σ = 94053630190494. Its totient is φ = 94053630190492.
The previous prime is 94053630190459. The next prime is 94053630190589. The reversal of 94053630190493 is 39409103635049.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48465503588089 + 45588126602404 = 6961717^2 + 6751898^2 .
It is an emirp because it is prime and its reverse (39409103635049) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 94053630190493 - 232 = 94049335223197 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (94053630190423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 47026815095246 + 47026815095247.
It is an arithmetic number, because the mean of its divisors is an integer number (47026815095247).
Almost surely, 294053630190493 is an apocalyptic number.
It is an amenable number.
94053630190493 is a deficient number, since it is larger than the sum of its proper divisors (1).
94053630190493 is an equidigital number, since it uses as much as digits as its factorization.
94053630190493 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9447840, while the sum is 56.
The spelling of 94053630190493 in words is "ninety-four trillion, fifty-three billion, six hundred thirty million, one hundred ninety thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •