Base | Representation |
---|---|
bin | 100000110100010101111110… |
… | …110111011110100101001101 |
3 | 200221001020120210002011112212 |
4 | 200310111332313132211031 |
5 | 122404234031120020402 |
6 | 1230550204520240205 |
7 | 42254552400166001 |
oct | 4064257667364515 |
9 | 627036523064485 |
10 | 144334504454477 |
11 | 41a97a12a76497 |
12 | 14230bb1610065 |
13 | 626c8ba9a5cac |
14 | 278db82122701 |
15 | 11a4711e4c952 |
hex | 83457edde94d |
144334504454477 has 2 divisors, whose sum is σ = 144334504454478. Its totient is φ = 144334504454476.
The previous prime is 144334504454443. The next prime is 144334504454531. The reversal of 144334504454477 is 774454405433441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 144332495711716 + 2008742761 = 12013846^2 + 44819^2 .
It is a cyclic number.
It is not a de Polignac number, because 144334504454477 - 216 = 144334504388941 is a prime.
It is a super-2 number, since 2×1443345044544772 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144334504454417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72167252227238 + 72167252227239.
It is an arithmetic number, because the mean of its divisors is an integer number (72167252227239).
Almost surely, 2144334504454477 is an apocalyptic number.
It is an amenable number.
144334504454477 is a deficient number, since it is larger than the sum of its proper divisors (1).
144334504454477 is an equidigital number, since it uses as much as digits as its factorization.
144334504454477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180633600, while the sum is 59.
The spelling of 144334504454477 in words is "one hundred forty-four trillion, three hundred thirty-four billion, five hundred four million, four hundred fifty-four thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •