Base | Representation |
---|---|
bin | 1000011000011100111… |
… | …1111011101000011101 |
3 | 111202200211002102200212 |
4 | 2012013033323220131 |
5 | 4324404233140331 |
6 | 150053140302205 |
7 | 13255346325314 |
oct | 2060717735035 |
9 | 452624072625 |
10 | 144003021341 |
11 | 56086a51343 |
12 | 23aaa3a1965 |
13 | 1076c00098a |
14 | 6d8112b27b |
15 | 3b2c391d2b |
hex | 21873fba1d |
144003021341 has 4 divisors (see below), whose sum is σ = 144003784284. Its totient is φ = 144002258400.
The previous prime is 144003021311. The next prime is 144003021359. The reversal of 144003021341 is 143120300441.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 100269755716 + 43733265625 = 316654^2 + 209125^2 .
It is a cyclic number.
It is not a de Polignac number, because 144003021341 - 230 = 142929279517 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 (144003021311) 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, 132311 + ... + 552731.
It is an arithmetic number, because the mean of its divisors is an integer number (36000946071).
Almost surely, 2144003021341 is an apocalyptic number.
It is an amenable number.
144003021341 is a deficient number, since it is larger than the sum of its proper divisors (762943).
144003021341 is an equidigital number, since it uses as much as digits as its factorization.
144003021341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 762942.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 144003021341 its reverse (143120300441), we get a palindrome (287123321782).
The spelling of 144003021341 in words is "one hundred forty-four billion, three million, twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •