Base | Representation |
---|---|
bin | 1010101011110… |
… | …00100010001101 |
3 | 20020122022012010 |
4 | 11111320202031 |
5 | 140420411134 |
6 | 12520531433 |
7 | 2135531403 |
oct | 525704215 |
9 | 206568163 |
10 | 89622669 |
11 | 46653924 |
12 | 26020b79 |
13 | 1574c286 |
14 | bc8d473 |
15 | 7d04ce9 |
hex | 557888d |
89622669 has 8 divisors (see below), whose sum is σ = 120657472. Its totient is φ = 59168160.
The previous prime is 89622667. The next prime is 89622671. The reversal of 89622669 is 96622698.
It is an interprime number because it is at equal distance from previous prime (89622667) and next prime (89622671).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 89622669 - 21 = 89622667 is a prime.
It is a super-2 number, since 2×896226692 = 16064445597367122, which contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 16.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (89622667) 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 in 7 ways as a sum of consecutive naturals, for example, 144712 + ... + 145329.
It is an arithmetic number, because the mean of its divisors is an integer number (15082184).
Almost surely, 289622669 is an apocalyptic number.
It is an amenable number.
89622669 is a deficient number, since it is larger than the sum of its proper divisors (31034803).
89622669 is a wasteful number, since it uses less digits than its factorization.
89622669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290147.
The product of its digits is 559872, while the sum is 48.
The square root of 89622669 is about 9466.9250023437. The cubic root of 89622669 is about 447.5133110904.
The spelling of 89622669 in words is "eighty-nine million, six hundred twenty-two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •