Base | Representation |
---|---|
bin | 1000011000111011010… |
… | …0101111011111011011 |
3 | 111210000200020021112222 |
4 | 2012032310233133123 |
5 | 4330134302031301 |
6 | 150113520254255 |
7 | 13261451506364 |
oct | 2061664573733 |
9 | 453020207488 |
10 | 144130111451 |
11 | 56141765a97 |
12 | 23b24a7138b |
13 | 1078c43ab21 |
14 | 6d93d70b6b |
15 | 3b385e831b |
hex | 218ed2f7db |
144130111451 has 8 divisors (see below), whose sum is σ = 147581220864. Its totient is φ = 140683513320.
The previous prime is 144130111439. The next prime is 144130111453. The reversal of 144130111451 is 154111031441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-144130111451 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 144130111451.
It is not an unprimeable number, because it can be changed into a prime (144130111453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1063115 + ... + 1190996.
It is an arithmetic number, because the mean of its divisors is an integer number (18447652608).
Almost surely, 2144130111451 is an apocalyptic number.
144130111451 is a deficient number, since it is larger than the sum of its proper divisors (3451109413).
144130111451 is a wasteful number, since it uses less digits than its factorization.
144130111451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2255641.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 144130111451 its reverse (154111031441), we get a palindrome (298241142892).
The spelling of 144130111451 in words is "one hundred forty-four billion, one hundred thirty million, one hundred eleven thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •