Base | Representation |
---|---|
bin | 1000011001101101101… |
… | …0001011010100000011 |
3 | 111210120101112022000112 |
4 | 2012123122023110003 |
5 | 4331102330020311 |
6 | 150150501541535 |
7 | 13266624251504 |
oct | 2063332132403 |
9 | 453511468015 |
10 | 144341251331 |
11 | 5623a967562 |
12 | 23b837148ab |
13 | 107c40c5774 |
14 | 6db4012bab |
15 | 3b4be0328b |
hex | 219b68b503 |
144341251331 has 4 divisors (see below), whose sum is σ = 152831913192. Its totient is φ = 135850589472.
The previous prime is 144341251277. The next prime is 144341251339. The reversal of 144341251331 is 133152143441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 144341251331 - 210 = 144341250307 is a prime.
It is a super-2 number, since 2×1443412513312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144341251339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4245330905 + ... + 4245330938.
It is an arithmetic number, because the mean of its divisors is an integer number (38207978298).
Almost surely, 2144341251331 is an apocalyptic number.
144341251331 is a deficient number, since it is larger than the sum of its proper divisors (8490661861).
144341251331 is an equidigital number, since it uses as much as digits as its factorization.
144341251331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8490661860.
The product of its digits is 17280, while the sum is 32.
Adding to 144341251331 its reverse (133152143441), we get a palindrome (277493394772).
The spelling of 144341251331 in words is "one hundred forty-four billion, three hundred forty-one million, two hundred fifty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •