Base | Representation |
---|---|
bin | 10001010000111… |
… | …00001101100111 |
3 | 101002111120101102 |
4 | 20220130031213 |
5 | 244033202142 |
6 | 22211550315 |
7 | 3405640652 |
oct | 1050341547 |
9 | 332446342 |
10 | 144819047 |
11 | 7482376a |
12 | 405bb39b |
13 | 24006959 |
14 | 1533a899 |
15 | caa9532 |
hex | 8a1c367 |
144819047 has 2 divisors, whose sum is σ = 144819048. Its totient is φ = 144819046.
The previous prime is 144819041. The next prime is 144819049. The reversal of 144819047 is 740918441.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 144819047 - 26 = 144818983 is a prime.
Together with 144819049, it forms a pair of twin primes.
It is a Chen prime.
It is a nialpdrome in base 15.
It is a self number, because there is not a number n which added to its sum of digits gives 144819047.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144819041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72409523 + 72409524.
It is an arithmetic number, because the mean of its divisors is an integer number (72409524).
Almost surely, 2144819047 is an apocalyptic number.
144819047 is a deficient number, since it is larger than the sum of its proper divisors (1).
144819047 is an equidigital number, since it uses as much as digits as its factorization.
144819047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 38.
The square root of 144819047 is about 12034.0785687979. The cubic root of 144819047 is about 525.1401554753.
The spelling of 144819047 in words is "one hundred forty-four million, eight hundred nineteen thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •