Base | Representation |
---|---|
bin | 100000110011110111001010… |
… | …011110011010011110011110 |
3 | 200220221002011121001222120210 |
4 | 200303313022132122132132 |
5 | 122403213243240322420 |
6 | 1230523053140153250 |
7 | 42252301353244365 |
oct | 4063671236323636 |
9 | 626832147058523 |
10 | 144301413214110 |
11 | 41a84981913859 |
12 | 142266b7398826 |
13 | 6269746061ca9 |
14 | 278c3233207dc |
15 | 11a3926c5a9e0 |
hex | 833dca79a79e |
144301413214110 has 64 divisors (see below), whose sum is σ = 361442536146432. Its totient is φ = 36801042343296.
The previous prime is 144301413213941. The next prime is 144301413214117. The reversal of 144301413214110 is 11412314103441.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144301413214117) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13774549 + ... + 21871008.
It is an arithmetic number, because the mean of its divisors is an integer number (5647539627288).
Almost surely, 2144301413214110 is an apocalyptic number.
144301413214110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
144301413214110 is an abundant number, since it is smaller than the sum of its proper divisors (217141122932322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144301413214110 is a wasteful number, since it uses less digits than its factorization.
144301413214110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35651457.
The product of its (nonzero) digits is 4608, while the sum is 30.
Adding to 144301413214110 its reverse (11412314103441), we get a palindrome (155713727317551).
The spelling of 144301413214110 in words is "one hundred forty-four trillion, three hundred one billion, four hundred thirteen million, two hundred fourteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •