Base | Representation |
---|---|
bin | 1010101010100… |
… | …11110000001011 |
3 | 20020100122112012 |
4 | 11111103300023 |
5 | 140401101021 |
6 | 12513410135 |
7 | 2134333226 |
oct | 525236013 |
9 | 206318465 |
10 | 89472011 |
11 | 46560712 |
12 | 25b6994b |
13 | 156c8825 |
14 | bc505bd |
15 | 7cc535b |
hex | 5553c0b |
89472011 has 2 divisors, whose sum is σ = 89472012. Its totient is φ = 89472010.
The previous prime is 89471959. The next prime is 89472013. The reversal of 89472011 is 11027498.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-89472011 is a prime.
Together with 89472013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (89472013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 44736005 + 44736006.
It is an arithmetic number, because the mean of its divisors is an integer number (44736006).
Almost surely, 289472011 is an apocalyptic number.
89472011 is a deficient number, since it is larger than the sum of its proper divisors (1).
89472011 is an equidigital number, since it uses as much as digits as its factorization.
89472011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 32.
The square root of 89472011 is about 9458.9645839278. The cubic root of 89472011 is about 447.2624100049.
The spelling of 89472011 in words is "eighty-nine million, four hundred seventy-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •