Base | Representation |
---|---|
bin | 111111001011110… |
… | …010110001001111 |
3 | 2201212200102122122 |
4 | 333023302301033 |
5 | 4132333244033 |
6 | 253104403155 |
7 | 35161220456 |
oct | 7713626117 |
9 | 2655612578 |
10 | 1060056143 |
11 | 4a4412963 |
12 | 2570164bb |
13 | 13b806873 |
14 | a0b01b9d |
15 | 630e5a98 |
hex | 3f2f2c4f |
1060056143 has 2 divisors, whose sum is σ = 1060056144. Its totient is φ = 1060056142.
The previous prime is 1060056133. The next prime is 1060056149. The reversal of 1060056143 is 3416500601.
It is a strong prime.
It is an emirp because it is prime and its reverse (3416500601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1060056143 is a prime.
It is a super-2 number, since 2×10600561432 = 2247438052624072898, which contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1060056149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530028071 + 530028072.
It is an arithmetic number, because the mean of its divisors is an integer number (530028072).
Almost surely, 21060056143 is an apocalyptic number.
1060056143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1060056143 is an equidigital number, since it uses as much as digits as its factorization.
1060056143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 1060056143 is about 32558.5033900516. The cubic root of 1060056143 is about 1019.6308234009.
Adding to 1060056143 its reverse (3416500601), we get a palindrome (4476556744).
The spelling of 1060056143 in words is "one billion, sixty million, fifty-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •