Base | Representation |
---|---|
bin | 1000011001010100001… |
… | …0011001011011111111 |
3 | 111210021221101101001002 |
4 | 2012111002121123333 |
5 | 4330342443320211 |
6 | 150132122440515 |
7 | 13264155532646 |
oct | 2062502313377 |
9 | 453257341032 |
10 | 144234354431 |
11 | 56195595312 |
12 | 23b5396313b |
13 | 107a7c0896b |
14 | 6da3b4835d |
15 | 3b4283a03b |
hex | 21950996ff |
144234354431 has 4 divisors (see below), whose sum is σ = 144250928472. Its totient is φ = 144217780392.
The previous prime is 144234354419. The next prime is 144234354437. The reversal of 144234354431 is 134453432441.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 134453432441 = 163997 ⋅819853.
It is a cyclic number.
It is not a de Polignac number, because 144234354431 - 234 = 127054485247 is a prime.
It is a super-2 number, since 2×1442343544312 (a number of 23 digits) contains 22 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 (144234354437) 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, 8273960 + ... + 8291373.
It is an arithmetic number, because the mean of its divisors is an integer number (36062732118).
Almost surely, 2144234354431 is an apocalyptic number.
144234354431 is a deficient number, since it is larger than the sum of its proper divisors (16574041).
144234354431 is an equidigital number, since it uses as much as digits as its factorization.
144234354431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16574040.
The product of its digits is 276480, while the sum is 38.
Adding to 144234354431 its reverse (134453432441), we get a palindrome (278687786872).
The spelling of 144234354431 in words is "one hundred forty-four billion, two hundred thirty-four million, three hundred fifty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •