Base | Representation |
---|---|
bin | 100000110101111011011010… |
… | …011100100000111000101101 |
3 | 200221102122200221121210111221 |
4 | 200311323122130200320231 |
5 | 122413030103224303201 |
6 | 1231112215552543341 |
7 | 42265456323155062 |
oct | 4065733234407055 |
9 | 627378627553457 |
10 | 144443415072301 |
11 | 4202a1211a3654 |
12 | 1424a127551b51 |
13 | 6279c5659c057 |
14 | 279515476cc69 |
15 | 11a74885aa4a1 |
hex | 835eda720e2d |
144443415072301 has 2 divisors, whose sum is σ = 144443415072302. Its totient is φ = 144443415072300.
The previous prime is 144443415072283. The next prime is 144443415072343. The reversal of 144443415072301 is 103270514344441.
144443415072301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83406227555401 + 61037187516900 = 9132701^2 + 7812630^2 .
It is a cyclic number.
It is not a de Polignac number, because 144443415072301 - 29 = 144443415071789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144443415072391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72221707536150 + 72221707536151.
It is an arithmetic number, because the mean of its divisors is an integer number (72221707536151).
Almost surely, 2144443415072301 is an apocalyptic number.
It is an amenable number.
144443415072301 is a deficient number, since it is larger than the sum of its proper divisors (1).
144443415072301 is an equidigital number, since it uses as much as digits as its factorization.
144443415072301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 645120, while the sum is 43.
The spelling of 144443415072301 in words is "one hundred forty-four trillion, four hundred forty-three billion, four hundred fifteen million, seventy-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •