Base | Representation |
---|---|
bin | 1000011001111110000… |
… | …0110110100101011100 |
3 | 111210202012002200202201 |
4 | 2012133200312211130 |
5 | 4331222442012200 |
6 | 150201401501244 |
7 | 13301421453511 |
oct | 2063740664534 |
9 | 453665080681 |
10 | 144410110300 |
11 | 562758192a5 |
12 | 23ba27a1824 |
13 | 10805454b11 |
14 | 6dbd219308 |
15 | 3b52ea5c6a |
hex | 219f83695c |
144410110300 has 18 divisors (see below), whose sum is σ = 313369939568. Its totient is φ = 57764044080.
The previous prime is 144410110237. The next prime is 144410110303. The reversal of 144410110300 is 3011014441.
144410110300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144410110303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 722050452 + ... + 722050651.
Almost surely, 2144410110300 is an apocalyptic number.
144410110300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
144410110300 is an abundant number, since it is smaller than the sum of its proper divisors (168959829268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144410110300 is a wasteful number, since it uses less digits than its factorization.
144410110300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1444101117 (or 1444101110 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 144410110300 its reverse (3011014441), we get a palindrome (147421124741).
The spelling of 144410110300 in words is "one hundred forty-four billion, four hundred ten million, one hundred ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •