Base | Representation |
---|---|
bin | 1000011011001011001… |
… | …01011100000101011101 |
3 | 1000200011110110101110000 |
4 | 10031211211130011131 |
5 | 14220312040401023 |
6 | 340551313004513 |
7 | 26625156640266 |
oct | 4154545340535 |
9 | 1020143411400 |
10 | 289467122013 |
11 | 10184270a163 |
12 | 48125b53739 |
13 | 213b1917424 |
14 | 1002030996d |
15 | 77e2b41243 |
hex | 436595c15d |
289467122013 has 40 divisors (see below), whose sum is σ = 454906663200. Its totient is φ = 183165548832.
The previous prime is 289467122003. The next prime is 289467122029. The reversal of 289467122013 is 310221764982.
It is not a de Polignac number, because 289467122013 - 212 = 289467117917 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 289467122013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (289467122003) 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 39 ways as a sum of consecutive naturals, for example, 905731 + ... + 1182912.
It is an arithmetic number, because the mean of its divisors is an integer number (11372666580).
Almost surely, 2289467122013 is an apocalyptic number.
It is an amenable number.
289467122013 is a deficient number, since it is larger than the sum of its proper divisors (165439541187).
289467122013 is a wasteful number, since it uses less digits than its factorization.
289467122013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2088743 (or 2088734 counting only the distinct ones).
The product of its (nonzero) digits is 290304, while the sum is 45.
Adding to 289467122013 its reverse (310221764982), we get a palindrome (599688886995).
The spelling of 289467122013 in words is "two hundred eighty-nine billion, four hundred sixty-seven million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •