Base | Representation |
---|---|
bin | 1000011000100110010… |
… | …1100010100110111001 |
3 | 111202210112212222012010 |
4 | 2012021211202212321 |
5 | 4324444303143231 |
6 | 150101101040133 |
7 | 13256333561601 |
oct | 2061145424671 |
9 | 452715788163 |
10 | 144042240441 |
11 | 560a70a9220 |
12 | 23abb556049 |
13 | 10777182c48 |
14 | 6d86419c01 |
15 | 3b30a3c546 |
hex | 21899629b9 |
144042240441 has 16 divisors (see below), whose sum is σ = 211474084608. Its totient is φ = 86482453200.
The previous prime is 144042240437. The next prime is 144042240443.
144042240441 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 144042240441 - 22 = 144042240437 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 144042240399 and 144042240408.
It is not an unprimeable number, because it can be changed into a prime (144042240443) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 20393275 + ... + 20400336.
It is an arithmetic number, because the mean of its divisors is an integer number (13217130288).
Almost surely, 2144042240441 is an apocalyptic number.
144042240441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
144042240441 is a deficient number, since it is larger than the sum of its proper divisors (67431844167).
144042240441 is a wasteful number, since it uses less digits than its factorization.
144042240441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40793732.
The product of its (nonzero) digits is 16384, while the sum is 30.
It can be divided in two parts, 144042 and 240441, that added together give a palindrome (384483).
The spelling of 144042240441 in words is "one hundred forty-four billion, forty-two million, two hundred forty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •