Base | Representation |
---|---|
bin | 101111000101011010… |
… | …0010101001110101001 |
3 | 100122222202100212211021 |
4 | 1132022310111032221 |
5 | 3124034441101212 |
6 | 114241211132441 |
7 | 10206452130601 |
oct | 1361264251651 |
9 | 318882325737 |
10 | 101113222057 |
11 | 39977861331 |
12 | 1771a744121 |
13 | 96c533c713 |
14 | 4c72c41c01 |
15 | 296bd33307 |
hex | 178ad153a9 |
101113222057 has 2 divisors, whose sum is σ = 101113222058. Its totient is φ = 101113222056.
The previous prime is 101113222039. The next prime is 101113222061. The reversal of 101113222057 is 750222311101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64548516096 + 36564705961 = 254064^2 + 191219^2 .
It is a cyclic number.
It is not a de Polignac number, because 101113222057 - 27 = 101113221929 is a prime.
It is a super-2 number, since 2×1011132220572 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101113228057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556611028 + 50556611029.
It is an arithmetic number, because the mean of its divisors is an integer number (50556611029).
Almost surely, 2101113222057 is an apocalyptic number.
It is an amenable number.
101113222057 is a deficient number, since it is larger than the sum of its proper divisors (1).
101113222057 is an equidigital number, since it uses as much as digits as its factorization.
101113222057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
Adding to 101113222057 its reverse (750222311101), we get a palindrome (851335533158).
The spelling of 101113222057 in words is "one hundred one billion, one hundred thirteen million, two hundred twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •