Base | Representation |
---|---|
bin | 101001111000010111… |
… | …1100111010111011101 |
3 | 22121010221220001121222 |
4 | 1103300233213113131 |
5 | 2433143210003043 |
6 | 105152255103125 |
7 | 6332520305303 |
oct | 1236057472735 |
9 | 277127801558 |
10 | 89938359773 |
11 | 3516294a959 |
12 | 15520211aa5 |
13 | 863411c882 |
14 | 44d2a54273 |
15 | 2515c52d68 |
hex | 14f0be75dd |
89938359773 has 2 divisors, whose sum is σ = 89938359774. Its totient is φ = 89938359772.
The previous prime is 89938359757. The next prime is 89938359811. The reversal of 89938359773 is 37795383998.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45513102244 + 44425257529 = 213338^2 + 210773^2 .
It is a cyclic number.
It is not a de Polignac number, because 89938359773 - 24 = 89938359757 is a prime.
It is a super-2 number, since 2×899383597732 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 89938359697 and 89938359706.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (89938359713) 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, 44969179886 + 44969179887.
It is an arithmetic number, because the mean of its divisors is an integer number (44969179887).
Almost surely, 289938359773 is an apocalyptic number.
It is an amenable number.
89938359773 is a deficient number, since it is larger than the sum of its proper divisors (1).
89938359773 is an equidigital number, since it uses as much as digits as its factorization.
89938359773 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 308629440, while the sum is 71.
The spelling of 89938359773 in words is "eighty-nine billion, nine hundred thirty-eight million, three hundred fifty-nine thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •