Base | Representation |
---|---|
bin | 100000101111111110000111… |
… | …011010000100110110000111 |
3 | 200212222111221002222210000212 |
4 | 200233332013122010312013 |
5 | 122334323113001443421 |
6 | 1230200150043430035 |
7 | 42224053535554301 |
oct | 4057760732046607 |
9 | 625874832883025 |
10 | 144034000031111 |
11 | 41991527071483 |
12 | 141a290722531b |
13 | 624a46a503b28 |
14 | 277d3d5dd6971 |
15 | 119b9c534ee5b |
hex | 82ff87684d87 |
144034000031111 has 4 divisors (see below), whose sum is σ = 144049812313800. Its totient is φ = 144018187748424.
The previous prime is 144034000031101. The next prime is 144034000031147. The reversal of 144034000031111 is 111130000430441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144034000031111 is a prime.
It is a super-3 number, since 3×1440340000311113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144034000031101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7906127681 + ... + 7906145898.
It is an arithmetic number, because the mean of its divisors is an integer number (36012453078450).
Almost surely, 2144034000031111 is an apocalyptic number.
144034000031111 is a deficient number, since it is larger than the sum of its proper divisors (15812282689).
144034000031111 is an equidigital number, since it uses as much as digits as its factorization.
144034000031111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15812282688.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 144034000031111 its reverse (111130000430441), we get a palindrome (255164000461552).
The spelling of 144034000031111 in words is "one hundred forty-four trillion, thirty-four billion, thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •