Base | Representation |
---|---|
bin | 100000110001001101111111… |
… | …011110000011011010000001 |
3 | 200220021201022022011200110001 |
4 | 200301031333132003122001 |
5 | 122342224240121430420 |
6 | 1230303412342240001 |
7 | 42233211105152560 |
oct | 4061157736033201 |
9 | 626251268150401 |
10 | 144119766201985 |
11 | 41a14938910032 |
12 | 141b7462126001 |
13 | 6255588134572 |
14 | 27836108b3bd7 |
15 | 119dd44b68b0a |
hex | 83137f783681 |
144119766201985 has 8 divisors (see below), whose sum is σ = 197649965077056. Its totient is φ = 98824982538480.
The previous prime is 144119766201941. The next prime is 144119766202007. The reversal of 144119766201985 is 589102667911441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144119766201985 - 235 = 144085406463617 is a prime.
It is a super-2 number, since 2×1441197662019852 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2058853802851 + ... + 2058853802920.
It is an arithmetic number, because the mean of its divisors is an integer number (24706245634632).
Almost surely, 2144119766201985 is an apocalyptic number.
It is an amenable number.
144119766201985 is a deficient number, since it is larger than the sum of its proper divisors (53530198875071).
144119766201985 is an equidigital number, since it uses as much as digits as its factorization.
144119766201985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4117707605783.
The product of its (nonzero) digits is 26127360, while the sum is 64.
The spelling of 144119766201985 in words is "one hundred forty-four trillion, one hundred nineteen billion, seven hundred sixty-six million, two hundred one thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •