Base | Representation |
---|---|
bin | 100000110101100111100110… |
… | …100011001100101010000101 |
3 | 200221100121210111001112121211 |
4 | 200311213212203030222011 |
5 | 122412203022142031230 |
6 | 1231054341113211421 |
7 | 42264104226205504 |
oct | 4065474643145205 |
9 | 627317714045554 |
10 | 144422143314565 |
11 | 420210a5907186 |
12 | 14245b8b700b71 |
13 | 6277c4659735c |
14 | 27940d75d883b |
15 | 11a6b40d7c42a |
hex | 8359e68cca85 |
144422143314565 has 8 divisors (see below), whose sum is σ = 176243971502880. Its totient is φ = 113579448301392.
The previous prime is 144422143314563. The next prime is 144422143314583. The reversal of 144422143314565 is 565413341224441.
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 144422143314565 - 21 = 144422143314563 is a prime.
It is a super-2 number, since 2×1444221433145652 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144422143314563) 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, 244783293459 + ... + 244783294048.
It is an arithmetic number, because the mean of its divisors is an integer number (22030496437860).
Almost surely, 2144422143314565 is an apocalyptic number.
It is an amenable number.
144422143314565 is a deficient number, since it is larger than the sum of its proper divisors (31821828188315).
144422143314565 is an equidigital number, since it uses as much as digits as its factorization.
144422143314565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 489566587571.
The product of its digits is 5529600, while the sum is 49.
The spelling of 144422143314565 in words is "one hundred forty-four trillion, four hundred twenty-two billion, one hundred forty-three million, three hundred fourteen thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •