Base | Representation |
---|---|
bin | 100000110010110101101101… |
… | …011001010111101011011111 |
3 | 200220200100202120211012102212 |
4 | 200302311231121113223133 |
5 | 122401040324311242421 |
6 | 1230430511204511035 |
7 | 42244232624025461 |
oct | 4062655531275337 |
9 | 626610676735385 |
10 | 144231132134111 |
11 | 41a58096aa0170 |
12 | 14214b623ab47b |
13 | 6262c25612519 |
14 | 2788b7725c131 |
15 | 11a1bb1b26e5b |
hex | 832d6d657adf |
144231132134111 has 16 divisors (see below), whose sum is σ = 166857622783488. Its totient is φ = 123214393430400.
The previous prime is 144231132134107. The next prime is 144231132134123. The reversal of 144231132134111 is 111431231132441.
It is a cyclic number.
It is not a de Polignac number, because 144231132134111 - 22 = 144231132134107 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144231132134711) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 599638295 + ... + 599878776.
It is an arithmetic number, because the mean of its divisors is an integer number (10428601423968).
Almost surely, 2144231132134111 is an apocalyptic number.
144231132134111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
144231132134111 is a deficient number, since it is larger than the sum of its proper divisors (22626490649377).
144231132134111 is a wasteful number, since it uses less digits than its factorization.
144231132134111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1199517742.
The product of its digits is 6912, while the sum is 32.
Adding to 144231132134111 its reverse (111431231132441), we get a palindrome (255662363266552).
The spelling of 144231132134111 in words is "one hundred forty-four trillion, two hundred thirty-one billion, one hundred thirty-two million, one hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •