Base | Representation |
---|---|
bin | 1000011001100100110… |
… | …1010101111001111101 |
3 | 111210110211001121210012 |
4 | 2012121031111321331 |
5 | 4331013402114123 |
6 | 150143102353005 |
7 | 13265665405253 |
oct | 2063115257175 |
9 | 453424047705 |
10 | 144304332413 |
11 | 5622104085a |
12 | 23b7328b765 |
13 | 107b956a457 |
14 | 6dad1625d3 |
15 | 3b48a5e378 |
hex | 2199355e7d |
144304332413 has 2 divisors, whose sum is σ = 144304332414. Its totient is φ = 144304332412.
The previous prime is 144304332379. The next prime is 144304332443. The reversal of 144304332413 is 314233403441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144276906244 + 27426169 = 379838^2 + 5237^2 .
It is an emirp because it is prime and its reverse (314233403441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 144304332413 - 210 = 144304331389 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 144304332413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144304332443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72152166206 + 72152166207.
It is an arithmetic number, because the mean of its divisors is an integer number (72152166207).
Almost surely, 2144304332413 is an apocalyptic number.
It is an amenable number.
144304332413 is a deficient number, since it is larger than the sum of its proper divisors (1).
144304332413 is an equidigital number, since it uses as much as digits as its factorization.
144304332413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 144304332413 its reverse (314233403441), we get a palindrome (458537735854).
The spelling of 144304332413 in words is "one hundred forty-four billion, three hundred four million, three hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •