Base | Representation |
---|---|
bin | 100000100101011111110001… |
… | …010100011001100001100001 |
3 | 200210102201001120102202010222 |
4 | 200211133301110121201201 |
5 | 122241030011420001423 |
6 | 1224445351143332425 |
7 | 42121053014046161 |
oct | 4045376124314141 |
9 | 623381046382128 |
10 | 143314222422113 |
11 | 417342473aa486 |
12 | 140a730b151115 |
13 | 61c761c786092 |
14 | 275663417a5a1 |
15 | 1187de9d0a3c8 |
hex | 8257f1519861 |
143314222422113 has 2 divisors, whose sum is σ = 143314222422114. Its totient is φ = 143314222422112.
The previous prime is 143314222422079. The next prime is 143314222422221. The reversal of 143314222422113 is 311224222413341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 134128061588689 + 9186160833424 = 11581367^2 + 3030868^2 .
It is a cyclic number.
It is not a de Polignac number, because 143314222422113 - 238 = 143039344515169 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (143314222422913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71657111211056 + 71657111211057.
It is an arithmetic number, because the mean of its divisors is an integer number (71657111211057).
Almost surely, 2143314222422113 is an apocalyptic number.
It is an amenable number.
143314222422113 is a deficient number, since it is larger than the sum of its proper divisors (1).
143314222422113 is an equidigital number, since it uses as much as digits as its factorization.
143314222422113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 55296, while the sum is 35.
Adding to 143314222422113 its reverse (311224222413341), we get a palindrome (454538444835454).
The spelling of 143314222422113 in words is "one hundred forty-three trillion, three hundred fourteen billion, two hundred twenty-two million, four hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •