Base | Representation |
---|---|
bin | 11111011111110010010… |
… | …01010010010010000101 |
3 | 10211110101112202011220121 |
4 | 33233321021102102011 |
5 | 120212334442033021 |
6 | 2145055152501541 |
7 | 141121224421141 |
oct | 17577111222205 |
9 | 3743345664817 |
10 | 1082216752261 |
11 | 387a69163837 |
12 | 1558a824a8b1 |
13 | 7b08b749088 |
14 | 3a545780221 |
15 | 1d23e660741 |
hex | fbf9252485 |
1082216752261 has 2 divisors, whose sum is σ = 1082216752262. Its totient is φ = 1082216752260.
The previous prime is 1082216752259. The next prime is 1082216752271. The reversal of 1082216752261 is 1622576122801.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 729017130625 + 353199621636 = 853825^2 + 594306^2 .
It is an emirp because it is prime and its reverse (1622576122801) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1082216752261 - 21 = 1082216752259 is a prime.
It is a super-2 number, since 2×10822167522612 (a number of 25 digits) contains 22 as substring.
Together with 1082216752259, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1082216752271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 541108376130 + 541108376131.
It is an arithmetic number, because the mean of its divisors is an integer number (541108376131).
Almost surely, 21082216752261 is an apocalyptic number.
It is an amenable number.
1082216752261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1082216752261 is an equidigital number, since it uses as much as digits as its factorization.
1082216752261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 161280, while the sum is 43.
The spelling of 1082216752261 in words is "one trillion, eighty-two billion, two hundred sixteen million, seven hundred fifty-two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •