Base | Representation |
---|---|
bin | 111110111111100… |
… | …000011000010101 |
3 | 2201122121210012111 |
4 | 332333200120111 |
5 | 4131022210333 |
6 | 252511351021 |
7 | 35121643606 |
oct | 7677403025 |
9 | 2648553174 |
10 | 1056835093 |
11 | 4a2612936 |
12 | 255b22471 |
13 | 13ac49712 |
14 | a0503dad |
15 | 62bab4cd |
hex | 3efe0615 |
1056835093 has 2 divisors, whose sum is σ = 1056835094. Its totient is φ = 1056835092.
The previous prime is 1056835049. The next prime is 1056835111. The reversal of 1056835093 is 3905386501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1053456849 + 3378244 = 32457^2 + 1838^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056835093 - 217 = 1056704021 is a prime.
It is a super-2 number, since 2×10568350932 = 2233800827592637298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1056835193) 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, 528417546 + 528417547.
It is an arithmetic number, because the mean of its divisors is an integer number (528417547).
Almost surely, 21056835093 is an apocalyptic number.
It is an amenable number.
1056835093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056835093 is an equidigital number, since it uses as much as digits as its factorization.
1056835093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 40.
The square root of 1056835093 is about 32509.0001845643. Note that the first 3 decimals coincide. The cubic root of 1056835093 is about 1018.5970372773.
The spelling of 1056835093 in words is "one billion, fifty-six million, eight hundred thirty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •