Base | Representation |
---|---|
bin | 100000111000010110101100… |
… | …001111100010001000100001 |
3 | 200222000121001112211201010101 |
4 | 200320112230033202020201 |
5 | 122423243033233022040 |
6 | 1231320552144502401 |
7 | 42313511111502016 |
oct | 4070265417421041 |
9 | 628017045751111 |
10 | 144610143642145 |
11 | 420938aa11a935 |
12 | 142764b861aa01 |
13 | 628c8a7837b3c |
14 | 279d24db4570d |
15 | 11ab995ae809a |
hex | 8385ac3e2221 |
144610143642145 has 16 divisors (see below), whose sum is σ = 179131801231872. Its totient is φ = 111955104708480.
The previous prime is 144610143642137. The next prime is 144610143642161. The reversal of 144610143642145 is 541246341016441.
It is not a de Polignac number, because 144610143642145 - 23 = 144610143642137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 144610143642095 and 144610143642104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10763109 + ... + 20126221.
It is an arithmetic number, because the mean of its divisors is an integer number (11195737576992).
Almost surely, 2144610143642145 is an apocalyptic number.
It is an amenable number.
144610143642145 is a deficient number, since it is larger than the sum of its proper divisors (34521657589727).
144610143642145 is an equidigital number, since it uses as much as digits as its factorization.
144610143642145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9462792.
The product of its (nonzero) digits is 1105920, while the sum is 46.
Adding to 144610143642145 its reverse (541246341016441), we get a palindrome (685856484658586).
The spelling of 144610143642145 in words is "one hundred forty-four trillion, six hundred ten billion, one hundred forty-three million, six hundred forty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •