Base | Representation |
---|---|
bin | 10001001110110… |
… | …11010010110101 |
3 | 101002000001122001 |
4 | 20213123102311 |
5 | 244001200031 |
6 | 22202135301 |
7 | 3403452505 |
oct | 1047332265 |
9 | 332001561 |
10 | 144553141 |
11 | 74661a07 |
12 | 404b1531 |
13 | 23c42905 |
14 | 152aba05 |
15 | ca55861 |
hex | 89db4b5 |
144553141 has 4 divisors (see below), whose sum is σ = 144582732. Its totient is φ = 144523552.
The previous prime is 144553133. The next prime is 144553151. The reversal of 144553141 is 141355441.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141355441 = 211 ⋅669931.
It can be written as a sum of positive squares in 2 ways, for example, as 21808900 + 122744241 = 4670^2 + 11079^2 .
It is a cyclic number.
It is not a de Polignac number, because 144553141 - 23 = 144553133 is a prime.
It is a super-2 number, since 2×1445531412 = 41791221145931762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144553151) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5536 + ... + 17881.
It is an arithmetic number, because the mean of its divisors is an integer number (36145683).
Almost surely, 2144553141 is an apocalyptic number.
It is an amenable number.
144553141 is a deficient number, since it is larger than the sum of its proper divisors (29591).
144553141 is an equidigital number, since it uses as much as digits as its factorization.
144553141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29590.
The product of its digits is 4800, while the sum is 28.
The square root of 144553141 is about 12023.0254511916. The cubic root of 144553141 is about 524.8185507494.
The spelling of 144553141 in words is "one hundred forty-four million, five hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •