Base | Representation |
---|---|
bin | 100000110011000001111001… |
… | …100000011101011001111111 |
3 | 200220201121112201100220110202 |
4 | 200303001321200131121333 |
5 | 122401244130334033210 |
6 | 1230440514023554115 |
7 | 42245205146650403 |
oct | 4063017140353177 |
9 | 626647481326422 |
10 | 144244220221055 |
11 | 41a626a296a649 |
12 | 142175b55bb93b |
13 | 6264230016476 |
14 | 2789659597103 |
15 | 11a21cab789a5 |
hex | 83307981d67f |
144244220221055 has 4 divisors (see below), whose sum is σ = 173093064265272. Its totient is φ = 115395376176840.
The previous prime is 144244220221007. The next prime is 144244220221063. The reversal of 144244220221055 is 550122022442441.
144244220221055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 144244220221055 - 28 = 144244220220799 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14424422022101 + ... + 14424422022110.
It is an arithmetic number, because the mean of its divisors is an integer number (43273266066318).
Almost surely, 2144244220221055 is an apocalyptic number.
144244220221055 is a deficient number, since it is larger than the sum of its proper divisors (28848844044217).
144244220221055 is an equidigital number, since it uses as much as digits as its factorization.
144244220221055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28848844044216.
The product of its (nonzero) digits is 204800, while the sum is 38.
Adding to 144244220221055 its reverse (550122022442441), we get a palindrome (694366242663496).
The spelling of 144244220221055 in words is "one hundred forty-four trillion, two hundred forty-four billion, two hundred twenty million, two hundred twenty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.580 sec. • engine limits •