Base | Representation |
---|---|
bin | 1000011010100000111… |
… | …1111000001101010111 |
3 | 111211010101211221220202 |
4 | 2012220033320031113 |
5 | 4332023000433242 |
6 | 150224114451115 |
7 | 13305151204031 |
oct | 2065017701527 |
9 | 454111757822 |
10 | 144556655447 |
11 | 56340510896 |
12 | 24023893a9b |
13 | 10829914319 |
14 | 6dd4884c51 |
15 | 3b60ca1932 |
hex | 21a83f8357 |
144556655447 has 2 divisors, whose sum is σ = 144556655448. Its totient is φ = 144556655446.
The previous prime is 144556655423. The next prime is 144556655449. The reversal of 144556655447 is 744556655441.
144556655447 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 144556655447 - 216 = 144556589911 is a prime.
Together with 144556655449, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 144556655392 and 144556655401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144556655449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72278327723 + 72278327724.
It is an arithmetic number, because the mean of its divisors is an integer number (72278327724).
Almost surely, 2144556655447 is an apocalyptic number.
144556655447 is a deficient number, since it is larger than the sum of its proper divisors (1).
144556655447 is an equidigital number, since it uses as much as digits as its factorization.
144556655447 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 40320000, while the sum is 56.
The spelling of 144556655447 in words is "one hundred forty-four billion, five hundred fifty-six million, six hundred fifty-five thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •