Base | Representation |
---|---|
bin | 1000011000110111000… |
… | …0000011000011011001 |
3 | 111202222102100101111001 |
4 | 2012031300003003121 |
5 | 4330120144304031 |
6 | 150112034305001 |
7 | 13261142445442 |
oct | 2061560030331 |
9 | 452872311431 |
10 | 144112103641 |
11 | 56132586500 |
12 | 23b1aa28161 |
13 | 107887a440c |
14 | 6d918042c9 |
15 | 3b36c3c861 |
hex | 218dc030d9 |
144112103641 has 9 divisors (see below), whose sum is σ = 158408803189. Its totient is φ = 131007207100.
The previous prime is 144112103579. The next prime is 144112103699. The reversal of 144112103641 is 146301211441.
The square root of 144112103641 is 379621.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 144112103641 - 235 = 109752365273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144112109641) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4158576 + ... + 4193086.
Almost surely, 2144112103641 is an apocalyptic number.
144112103641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
144112103641 is the 379621-st square number.
144112103641 is the 189811-st centered octagonal number.
It is an amenable number.
144112103641 is a deficient number, since it is larger than the sum of its proper divisors (14296699548).
144112103641 is an frugal number, since it uses more digits than its factorization.
144112103641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69044 (or 34522 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 28.
Multiplying 144112103641 by its product of nonzero digits (2304), we get a square (332034286788864 = 182218082).
The spelling of 144112103641 in words is "one hundred forty-four billion, one hundred twelve million, one hundred three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •