Base | Representation |
---|---|
bin | 1010010101010011111101… |
… | …0010001010100010011001 |
3 | 1111020010101001200111002202 |
4 | 2211110333102022202121 |
5 | 2442120320024134111 |
6 | 40055141501335545 |
7 | 2251552241342306 |
oct | 245247722124231 |
9 | 44203331614082 |
10 | 11361250224281 |
11 | 3690308623281 |
12 | 1335a778675b5 |
13 | 645490a0a809 |
14 | 2b3c5d2120ad |
15 | 14a7eb227b3b |
hex | a553f48a899 |
11361250224281 has 2 divisors, whose sum is σ = 11361250224282. Its totient is φ = 11361250224280.
The previous prime is 11361250224209. The next prime is 11361250224353. The reversal of 11361250224281 is 18242205216311.
It is a balanced prime because it is at equal distance from previous prime (11361250224209) and next prime (11361250224353).
It can be written as a sum of positive squares in only one way, i.e., 6062138303881 + 5299111920400 = 2462141^2 + 2301980^2 .
It is a cyclic number.
It is not a de Polignac number, because 11361250224281 - 222 = 11361246029977 is a prime.
It is a super-2 number, since 2×113612502242812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11361250224481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5680625112140 + 5680625112141.
It is an arithmetic number, because the mean of its divisors is an integer number (5680625112141).
Almost surely, 211361250224281 is an apocalyptic number.
It is an amenable number.
11361250224281 is a deficient number, since it is larger than the sum of its proper divisors (1).
11361250224281 is an equidigital number, since it uses as much as digits as its factorization.
11361250224281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46080, while the sum is 38.
The spelling of 11361250224281 in words is "eleven trillion, three hundred sixty-one billion, two hundred fifty million, two hundred twenty-four thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •