Base | Representation |
---|---|
bin | 11111001101001100011… |
… | …101111011010010100101 |
3 | 21121000020220122020201101 |
4 | 133031030131323102211 |
5 | 240113334212003044 |
6 | 4321053500400101 |
7 | 310635001536013 |
oct | 37151435732245 |
9 | 7530226566641 |
10 | 2144471594149 |
11 | 757513343885 |
12 | 2a7743246031 |
13 | 1272b8665661 |
14 | 75b15d118b3 |
15 | 3abb157acd4 |
hex | 1f34c77b4a5 |
2144471594149 has 2 divisors, whose sum is σ = 2144471594150. Its totient is φ = 2144471594148.
The previous prime is 2144471594141. The next prime is 2144471594203. The reversal of 2144471594149 is 9414951744412.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2111049173025 + 33422421124 = 1452945^2 + 182818^2 .
It is a cyclic number.
It is not a de Polignac number, because 2144471594149 - 23 = 2144471594141 is a prime.
It is a super-2 number, since 2×21444715941492 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2144471594149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2144471594141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1072235797074 + 1072235797075.
It is an arithmetic number, because the mean of its divisors is an integer number (1072235797075).
Almost surely, 22144471594149 is an apocalyptic number.
It is an amenable number.
2144471594149 is a deficient number, since it is larger than the sum of its proper divisors (1).
2144471594149 is an equidigital number, since it uses as much as digits as its factorization.
2144471594149 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5806080, while the sum is 55.
The spelling of 2144471594149 in words is "two trillion, one hundred forty-four billion, four hundred seventy-one million, five hundred ninety-four thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •