Base | Representation |
---|---|
bin | 1000011010011001010… |
… | …0111111000111000000 |
3 | 111211001011020020122001 |
4 | 2012212110333013000 |
5 | 4331441224040000 |
6 | 150221004153344 |
7 | 13304310320323 |
oct | 2064624770700 |
9 | 454034206561 |
10 | 144524440000 |
11 | 56324307956 |
12 | 24014b38854 |
13 | 10823044b25 |
14 | 6dd049a7ba |
15 | 3b5d03b46a |
hex | 21a653f1c0 |
144524440000 has 140 divisors (see below), whose sum is σ = 361122410088. Its totient is φ = 57366400000.
The previous prime is 144524439971. The next prime is 144524440069. The reversal of 144524440000 is 44425441.
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 5226210 + ... + 5253790.
Almost surely, 2144524440000 is an apocalyptic number.
144524440000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 144524440000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180561205044).
144524440000 is an abundant number, since it is smaller than the sum of its proper divisors (216597970088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144524440000 is an equidigital number, since it uses as much as digits as its factorization.
144524440000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27744 (or 27719 counting only the distinct ones).
The product of its (nonzero) digits is 10240, while the sum is 28.
Adding to 144524440000 its reverse (44425441), we get a palindrome (144568865441).
The spelling of 144524440000 in words is "one hundred forty-four billion, five hundred twenty-four million, four hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •