Base | Representation |
---|---|
bin | 1000011010000001010… |
… | …1111101101101110101 |
3 | 111210210011022001022111 |
4 | 2012200111331231311 |
5 | 4331240023030031 |
6 | 150203020131021 |
7 | 13301651012053 |
oct | 2064025755565 |
9 | 453704261274 |
10 | 144424033141 |
11 | 56282668783 |
12 | 23ba7396a71 |
13 | 108082bb09b |
14 | 6dc10011d3 |
15 | 3b543061b1 |
hex | 21a057db75 |
144424033141 has 4 divisors (see below), whose sum is σ = 144618413472. Its totient is φ = 144229652812.
The previous prime is 144424033099. The next prime is 144424033153. The reversal of 144424033141 is 141330424441.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 141330424441 = 2239 ⋅63122119.
It is a cyclic number.
It is not a de Polignac number, because 144424033141 - 221 = 144421935989 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 (144424033241) 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, 97189051 + ... + 97190536.
It is an arithmetic number, because the mean of its divisors is an integer number (36154603368).
Almost surely, 2144424033141 is an apocalyptic number.
It is an amenable number.
144424033141 is a deficient number, since it is larger than the sum of its proper divisors (194380331).
144424033141 is an equidigital number, since it uses as much as digits as its factorization.
144424033141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194380330.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 144424033141 its reverse (141330424441), we get a palindrome (285754457582).
The spelling of 144424033141 in words is "one hundred forty-four billion, four hundred twenty-four million, thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •