Base | Representation |
---|---|
bin | 100000011000110101101101… |
… | …110110101101101100001101 |
3 | 200200100112222110222221111011 |
4 | 200120311231312231230031 |
5 | 122132302144424300214 |
6 | 1222542022550525221 |
7 | 42001161564443512 |
oct | 4030655566555415 |
9 | 620315873887434 |
10 | 142444433431309 |
11 | 41429388175a89 |
12 | 13b86828666811 |
13 | 61635b6002399 |
14 | 27264c1249309 |
15 | 117048ebd8ac4 |
hex | 818d6ddadb0d |
142444433431309 has 2 divisors, whose sum is σ = 142444433431310. Its totient is φ = 142444433431308.
The previous prime is 142444433431297. The next prime is 142444433431331. The reversal of 142444433431309 is 903134334444241.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 122747897097225 + 19696536334084 = 11079165^2 + 4438078^2 .
It is an emirp because it is prime and its reverse (903134334444241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142444433431309 - 211 = 142444433429261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142444433432309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71222216715654 + 71222216715655.
It is an arithmetic number, because the mean of its divisors is an integer number (71222216715655).
Almost surely, 2142444433431309 is an apocalyptic number.
It is an amenable number.
142444433431309 is a deficient number, since it is larger than the sum of its proper divisors (1).
142444433431309 is an equidigital number, since it uses as much as digits as its factorization.
142444433431309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5971968, while the sum is 49.
The spelling of 142444433431309 in words is "one hundred forty-two trillion, four hundred forty-four billion, four hundred thirty-three million, four hundred thirty-one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •