Base | Representation |
---|---|
bin | 110011101111001010010111… |
… | …010111111111001010000101 |
3 | 1002211122201220121121010022021 |
4 | 303233022113113333022011 |
5 | 214311014104131230414 |
6 | 2123535012112203141 |
7 | 65633213645553031 |
oct | 6357122727771205 |
9 | 1084581817533267 |
10 | 227541317055109 |
11 | 66557804540162 |
12 | 2162b0468394b1 |
13 | 99c7091bc83b5 |
14 | 40290b67891c1 |
15 | 1b48d1269cc24 |
hex | cef2975ff285 |
227541317055109 has 2 divisors, whose sum is σ = 227541317055110. Its totient is φ = 227541317055108.
The previous prime is 227541317055103. The next prime is 227541317055127. The reversal of 227541317055109 is 901550713145722.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 187905919262884 + 39635397792225 = 13707878^2 + 6295665^2 .
It is a cyclic number.
It is not a de Polignac number, because 227541317055109 - 217 = 227541316924037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (227541317055103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 113770658527554 + 113770658527555.
It is an arithmetic number, because the mean of its divisors is an integer number (113770658527555).
Almost surely, 2227541317055109 is an apocalyptic number.
It is an amenable number.
227541317055109 is a deficient number, since it is larger than the sum of its proper divisors (1).
227541317055109 is an equidigital number, since it uses as much as digits as its factorization.
227541317055109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2646000, while the sum is 52.
The spelling of 227541317055109 in words is "two hundred twenty-seven trillion, five hundred forty-one billion, three hundred seventeen million, fifty-five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •