Base | Representation |
---|---|
bin | 100000110100001100011111… |
… | …010010100101001011001011 |
3 | 200221000021021101022122021220 |
4 | 200310030133102211023023 |
5 | 122404102142104341133 |
6 | 1230541401223333123 |
7 | 42254041653310641 |
oct | 4064143722451313 |
9 | 627007241278256 |
10 | 144324311012043 |
11 | 41a936620482a8 |
12 | 1422b0278b11a3 |
13 | 626b954bb9256 |
14 | 278d496407191 |
15 | 11a43170cd5b3 |
hex | 83431f4a52cb |
144324311012043 has 8 divisors (see below), whose sum is σ = 192492493501248. Its totient is φ = 96186167932104.
The previous prime is 144324311011927. The next prime is 144324311012047. The reversal of 144324311012043 is 340210113423441.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144324311012043 - 216 = 144324310946507 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144324311011995 and 144324311012013.
It is not an unprimeable number, because it can be changed into a prime (144324311012047) 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, 7509841105 + ... + 7509860322.
It is an arithmetic number, because the mean of its divisors is an integer number (24061561687656).
Almost surely, 2144324311012043 is an apocalyptic number.
144324311012043 is a deficient number, since it is larger than the sum of its proper divisors (48168182489205).
144324311012043 is a wasteful number, since it uses less digits than its factorization.
144324311012043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15019704633.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 144324311012043 its reverse (340210113423441), we get a palindrome (484534424435484).
The spelling of 144324311012043 in words is "one hundred forty-four trillion, three hundred twenty-four billion, three hundred eleven million, twelve thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •