Base | Representation |
---|---|
bin | 100000110110111101010101… |
… | …101011111111110101011101 |
3 | 200221200102102020002202012012 |
4 | 200312331111223333311131 |
5 | 122420210041231034113 |
6 | 1231204524042521005 |
7 | 42303543435651566 |
oct | 4066752553776535 |
9 | 627612366082165 |
10 | 144514202205533 |
11 | 42057146738556 |
12 | 1425b9a1b06165 |
13 | 6283827b12bc4 |
14 | 279874bb2116d |
15 | 11a922cd50aa8 |
hex | 836f55affd5d |
144514202205533 has 8 divisors (see below), whose sum is σ = 149827374036480. Its totient is φ = 139241744335440.
The previous prime is 144514202205521. The next prime is 144514202205557. The reversal of 144514202205533 is 335502202415441.
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 144514202205533 - 234 = 144497022336349 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144514202205133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10178482985 + ... + 10178497182.
It is an arithmetic number, because the mean of its divisors is an integer number (18728421754560).
Almost surely, 2144514202205533 is an apocalyptic number.
It is an amenable number.
144514202205533 is a deficient number, since it is larger than the sum of its proper divisors (5313171830947).
144514202205533 is a wasteful number, since it uses less digits than its factorization.
144514202205533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20356980427.
The product of its (nonzero) digits is 576000, while the sum is 41.
The spelling of 144514202205533 in words is "one hundred forty-four trillion, five hundred fourteen billion, two hundred two million, two hundred five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •