Base | Representation |
---|---|
bin | 1000010110010100100… |
… | …1110001110100100101 |
3 | 111201012221200212112202 |
4 | 2011211021301310211 |
5 | 4322221312423244 |
6 | 145520303424245 |
7 | 13235232145022 |
oct | 2054511616445 |
9 | 451187625482 |
10 | 143430982949 |
11 | 55913061441 |
12 | 2396a8b5085 |
13 | 106aa645317 |
14 | 6d29182549 |
15 | 3ae704904e |
hex | 2165271d25 |
143430982949 has 2 divisors, whose sum is σ = 143430982950. Its totient is φ = 143430982948.
The previous prime is 143430982901. The next prime is 143430982951. The reversal of 143430982949 is 949289034341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137932760449 + 5498222500 = 371393^2 + 74150^2 .
It is a cyclic number.
It is not a de Polignac number, because 143430982949 - 236 = 74711506213 is a prime.
Together with 143430982951, 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 = 143430982894 and 143430982903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143430982969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71715491474 + 71715491475.
It is an arithmetic number, because the mean of its divisors is an integer number (71715491475).
Almost surely, 2143430982949 is an apocalyptic number.
It is an amenable number.
143430982949 is a deficient number, since it is larger than the sum of its proper divisors (1).
143430982949 is an equidigital number, since it uses as much as digits as its factorization.
143430982949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6718464, while the sum is 56.
The spelling of 143430982949 in words is "one hundred forty-three billion, four hundred thirty million, nine hundred eighty-two thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •