Base | Representation |
---|---|
bin | 100000001111111… |
… | …1001011101011001 |
3 | 2210102011120010122 |
4 | 1000133321131121 |
5 | 4204004304031 |
6 | 255213123025 |
7 | 35546505053 |
oct | 10037713531 |
9 | 2712146118 |
10 | 1082103641 |
11 | 505901533 |
12 | 262489475 |
13 | 143255c18 |
14 | a3a008d3 |
15 | 64eed47b |
hex | 407f9759 |
1082103641 has 2 divisors, whose sum is σ = 1082103642. Its totient is φ = 1082103640.
The previous prime is 1082103629. The next prime is 1082103653. The reversal of 1082103641 is 1463012801.
It is a balanced prime because it is at equal distance from previous prime (1082103629) and next prime (1082103653).
It can be written as a sum of positive squares in only one way, i.e., 905107225 + 176996416 = 30085^2 + 13304^2 .
It is a cyclic number.
It is not a de Polignac number, because 1082103641 - 214 = 1082087257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1082103641.
It is not a weakly prime, because it can be changed into another prime (1082103541) 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, 541051820 + 541051821.
It is an arithmetic number, because the mean of its divisors is an integer number (541051821).
Almost surely, 21082103641 is an apocalyptic number.
It is an amenable number.
1082103641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1082103641 is an equidigital number, since it uses as much as digits as its factorization.
1082103641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
The square root of 1082103641 is about 32895.3437586537. The cubic root of 1082103641 is about 1026.6512795781.
The spelling of 1082103641 in words is "one billion, eighty-two million, one hundred three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •