Base | Representation |
---|---|
bin | 100000110011111000110101… |
… | …000011001000010101101001 |
3 | 200220221020210012112022002211 |
4 | 200303320311003020111221 |
5 | 122403230424003132131 |
6 | 1230523550411325121 |
7 | 42252363564133336 |
oct | 4063706503102551 |
9 | 626836705468084 |
10 | 144303201224041 |
11 | 41a8570a129112 |
12 | 14226b161507a1 |
13 | 626996c614732 |
14 | 278c45299598d |
15 | 11a39cdbe65b1 |
hex | 833e350c8569 |
144303201224041 has 16 divisors (see below), whose sum is σ = 147062549450880. Its totient is φ = 141554571396480.
The previous prime is 144303201224027. The next prime is 144303201224107. The reversal of 144303201224041 is 140422102303441.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 144303201224041 - 25 = 144303201224009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144303201223994 and 144303201224012.
It is not an unprimeable number, because it can be changed into a prime (144303201224141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61520125 + ... + 63822661.
It is an arithmetic number, because the mean of its divisors is an integer number (9191409340680).
Almost surely, 2144303201224041 is an apocalyptic number.
It is an amenable number.
144303201224041 is a deficient number, since it is larger than the sum of its proper divisors (2759348226839).
144303201224041 is a wasteful number, since it uses less digits than its factorization.
144303201224041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2304864.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 144303201224041 its reverse (140422102303441), we get a palindrome (284725303527482).
The spelling of 144303201224041 in words is "one hundred forty-four trillion, three hundred three billion, two hundred one million, two hundred twenty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •