Base | Representation |
---|---|
bin | 101001100100110000… |
… | …0000001001111101111 |
3 | 22112110001222212222221 |
4 | 1103021200001033233 |
5 | 2430321132210142 |
6 | 105003055220211 |
7 | 6310304065465 |
oct | 1231140011757 |
9 | 275401885887 |
10 | 89279960047 |
11 | 34955234453 |
12 | 15377817667 |
13 | 855a8b7535 |
14 | 446d428835 |
15 | 24c804b767 |
hex | 14c98013ef |
89279960047 has 2 divisors, whose sum is σ = 89279960048. Its totient is φ = 89279960046.
The previous prime is 89279959987. The next prime is 89279960059. The reversal of 89279960047 is 74006997298.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 89279960047 - 231 = 87132476399 is a prime.
It is a super-2 number, since 2×892799600472 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (89279910047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 44639980023 + 44639980024.
It is an arithmetic number, because the mean of its divisors is an integer number (44639980024).
Almost surely, 289279960047 is an apocalyptic number.
89279960047 is a deficient number, since it is larger than the sum of its proper divisors (1).
89279960047 is an equidigital number, since it uses as much as digits as its factorization.
89279960047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13716864, while the sum is 61.
The spelling of 89279960047 in words is "eighty-nine billion, two hundred seventy-nine million, nine hundred sixty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •