Base | Representation |
---|---|
bin | 1010000111011001100000… |
… | …1011011001110110001111 |
3 | 1110101021101212122112112102 |
4 | 2201312120023121312033 |
5 | 2424211303201040011 |
6 | 35353251240225315 |
7 | 2225361031335551 |
oct | 241663013316617 |
9 | 43337355575472 |
10 | 11122223455631 |
11 | 35a89aa204172 |
12 | 12b768a16b23b |
13 | 628a8a163032 |
14 | 2a6465d034d1 |
15 | 1444ab96173b |
hex | a1d982d9d8f |
11122223455631 has 2 divisors, whose sum is σ = 11122223455632. Its totient is φ = 11122223455630.
The previous prime is 11122223455627. The next prime is 11122223455667. The reversal of 11122223455631 is 13655432222111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11122223455631 - 22 = 11122223455627 is a prime.
It is a super-2 number, since 2×111222234556312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11122223455601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561111727815 + 5561111727816.
It is an arithmetic number, because the mean of its divisors is an integer number (5561111727816).
Almost surely, 211122223455631 is an apocalyptic number.
11122223455631 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122223455631 is an equidigital number, since it uses as much as digits as its factorization.
11122223455631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 86400, while the sum is 38.
Adding to 11122223455631 its reverse (13655432222111), we get a palindrome (24777655677742).
The spelling of 11122223455631 in words is "eleven trillion, one hundred twenty-two billion, two hundred twenty-three million, four hundred fifty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •