Base | Representation |
---|---|
bin | 1000011010000011110… |
… | …1010101101101100001 |
3 | 111210210212201110022002 |
4 | 2012200331111231201 |
5 | 4331300143330131 |
6 | 150204025253345 |
7 | 13302134522054 |
oct | 2064075255541 |
9 | 453725643262 |
10 | 144434355041 |
11 | 56288478779 |
12 | 23baa934255 |
13 | 1080a493312 |
14 | 6dc252aa9b |
15 | 3b551946cb |
hex | 21a0f55b61 |
144434355041 has 8 divisors (see below), whose sum is σ = 150719849280. Its totient is φ = 138149339152.
The previous prime is 144434354989. The next prime is 144434355053. The reversal of 144434355041 is 140553434441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 144434355041 - 222 = 144430160737 is a prime.
It is a super-2 number, since 2×1444343550412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144434354986 and 144434355004.
It is not an unprimeable number, because it can be changed into a prime (144434355071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 586106 + ... + 795228.
It is an arithmetic number, because the mean of its divisors is an integer number (18839981160).
Almost surely, 2144434355041 is an apocalyptic number.
It is an amenable number.
144434355041 is a deficient number, since it is larger than the sum of its proper divisors (6285494239).
144434355041 is a wasteful number, since it uses less digits than its factorization.
144434355041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239175.
The product of its (nonzero) digits is 230400, while the sum is 38.
Adding to 144434355041 its reverse (140553434441), we get a palindrome (284987789482).
The spelling of 144434355041 in words is "one hundred forty-four billion, four hundred thirty-four million, three hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •