Base | Representation |
---|---|
bin | 101001110000000011… |
… | …0011111101011100011 |
3 | 22120102111111110212112 |
4 | 1103200012133223203 |
5 | 2432110220114211 |
6 | 105104442345535 |
7 | 6322560104666 |
oct | 1234006375343 |
9 | 276374443775 |
10 | 89659144931 |
11 | 3502a282694 |
12 | 154627bb2ab |
13 | 85bb31b6a5 |
14 | 44a79316dd |
15 | 24eb49c88b |
hex | 14e019fae3 |
89659144931 has 4 divisors (see below), whose sum is σ = 90997341192. Its totient is φ = 88320948672.
The previous prime is 89659144919. The next prime is 89659144943. The reversal of 89659144931 is 13944195698.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (89659144919) and next prime (89659144943).
It is a cyclic number.
It is not a de Polignac number, because 89659144931 - 218 = 89658882787 is a prime.
It is a super-2 number, since 2×896591449312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (89659144951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 669098030 + ... + 669098163.
It is an arithmetic number, because the mean of its divisors is an integer number (22749335298).
Almost surely, 289659144931 is an apocalyptic number.
89659144931 is a deficient number, since it is larger than the sum of its proper divisors (1338196261).
89659144931 is a wasteful number, since it uses less digits than its factorization.
89659144931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1338196260.
The product of its digits is 8398080, while the sum is 59.
The spelling of 89659144931 in words is "eighty-nine billion, six hundred fifty-nine million, one hundred forty-four thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •