Base | Representation |
---|---|
bin | 10001001111100… |
… | …11010010110101 |
3 | 101002012001110221 |
4 | 20213303102311 |
5 | 244012321240 |
6 | 22204214341 |
7 | 3404342221 |
oct | 1047632265 |
9 | 332161427 |
10 | 144651445 |
11 | 74719854 |
12 | 4053a3b1 |
13 | 23c78593 |
14 | 152d5781 |
15 | ca74a4a |
hex | 89f34b5 |
144651445 has 4 divisors (see below), whose sum is σ = 173581740. Its totient is φ = 115721152.
The previous prime is 144651443. The next prime is 144651467. The reversal of 144651445 is 544156441.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 544156441 = 229 ⋅2376229.
It can be written as a sum of positive squares in 2 ways, for example, as 31292836 + 113358609 = 5594^2 + 10647^2 .
It is a cyclic number.
It is not a de Polignac number, because 144651445 - 21 = 144651443 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 144651445.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144651443) 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, 14465140 + ... + 14465149.
It is an arithmetic number, because the mean of its divisors is an integer number (43395435).
Almost surely, 2144651445 is an apocalyptic number.
It is an amenable number.
144651445 is a deficient number, since it is larger than the sum of its proper divisors (28930295).
144651445 is an equidigital number, since it uses as much as digits as its factorization.
144651445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28930294.
The product of its digits is 38400, while the sum is 34.
The square root of 144651445 is about 12027.1129120833. The cubic root of 144651445 is about 524.9374921800.
The spelling of 144651445 in words is "one hundred forty-four million, six hundred fifty-one thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •