Base | Representation |
---|---|
bin | 1010001101101110101111… |
… | …0101100111001111100101 |
3 | 1110202200011210012002200022 |
4 | 2203123223311213033211 |
5 | 2433002042302240002 |
6 | 35515241205124525 |
7 | 2236261452115256 |
oct | 243335365471745 |
9 | 43680153162608 |
10 | 11231001211877 |
11 | 364004a435477 |
12 | 13147876b9745 |
13 | 63610437ac85 |
14 | 2ab824a46b2d |
15 | 1472265c7ba2 |
hex | a36ebd673e5 |
11231001211877 has 2 divisors, whose sum is σ = 11231001211878. Its totient is φ = 11231001211876.
The previous prime is 11231001211873. The next prime is 11231001211889. The reversal of 11231001211877 is 77811210013211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10167928860961 + 1063072350916 = 3188719^2 + 1031054^2 .
It is an emirp because it is prime and its reverse (77811210013211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11231001211877 - 22 = 11231001211873 is a prime.
It is a super-2 number, since 2×112310012118772 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11231001211873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615500605938 + 5615500605939.
It is an arithmetic number, because the mean of its divisors is an integer number (5615500605939).
Almost surely, 211231001211877 is an apocalyptic number.
It is an amenable number.
11231001211877 is a deficient number, since it is larger than the sum of its proper divisors (1).
11231001211877 is an equidigital number, since it uses as much as digits as its factorization.
11231001211877 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4704, while the sum is 35.
The spelling of 11231001211877 in words is "eleven trillion, two hundred thirty-one billion, one million, two hundred eleven thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •