Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …010010100001111111110001 |
3 | 111021000000121111212100110202 |
4 | 112333112002102201333301 |
5 | 101223041300304323212 |
6 | 555013144155004545 |
7 | 30203646221102036 |
oct | 2677260222417761 |
9 | 437000544770422 |
10 | 101110011011057 |
11 | 2a242573312a24 |
12 | b40b96a139755 |
13 | 445582cc954a9 |
14 | 1ad7a71aa738d |
15 | ba51840a60c2 |
hex | 5bf5824a1ff1 |
101110011011057 has 2 divisors, whose sum is σ = 101110011011058. Its totient is φ = 101110011011056.
The previous prime is 101110011010999. The next prime is 101110011011059. The reversal of 101110011011057 is 750110110011101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 89145302339041 + 11964708672016 = 9441679^2 + 3459004^2 .
It is a cyclic number.
It is not a de Polignac number, because 101110011011057 - 216 = 101110010945521 is a prime.
Together with 101110011011059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101110011011059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555005505528 + 50555005505529.
It is an arithmetic number, because the mean of its divisors is an integer number (50555005505529).
Almost surely, 2101110011011057 is an apocalyptic number.
It is an amenable number.
101110011011057 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110011011057 is an equidigital number, since it uses as much as digits as its factorization.
101110011011057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 35, while the sum is 20.
Adding to 101110011011057 its reverse (750110110011101), we get a palindrome (851220121022158).
The spelling of 101110011011057 in words is "one hundred one trillion, one hundred ten billion, eleven million, eleven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •