Base | Representation |
---|---|
bin | 11110100010001011110… |
… | …00011011111111101101 |
3 | 10201022000200100210100110 |
4 | 33101011320123333231 |
5 | 114142121434132421 |
6 | 2121545330250233 |
7 | 135540530424054 |
oct | 17210570337755 |
9 | 3638020323313 |
10 | 1049144442861 |
11 | 374a37761229 |
12 | 14b3b8426979 |
13 | 77c1aa02a28 |
14 | 38ac92a939b |
15 | 1c455e5ca76 |
hex | f445e1bfed |
1049144442861 has 8 divisors (see below), whose sum is σ = 1400139096160. Its totient is φ = 698789709072.
The previous prime is 1049144442821. The next prime is 1049144442889. The reversal of 1049144442861 is 1682444419401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1049144442861 - 225 = 1049110888429 is a prime.
It is a super-2 number, since 2×10491444428612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1049144442861.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1049144442821) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159976051 + ... + 159982608.
It is an arithmetic number, because the mean of its divisors is an integer number (175017387020).
Almost surely, 21049144442861 is an apocalyptic number.
It is an amenable number.
1049144442861 is a deficient number, since it is larger than the sum of its proper divisors (350994653299).
1049144442861 is a wasteful number, since it uses less digits than its factorization.
1049144442861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319959755.
The product of its (nonzero) digits is 884736, while the sum is 48.
The spelling of 1049144442861 in words is "one trillion, forty-nine billion, one hundred forty-four million, four hundred forty-two thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •