Base | Representation |
---|---|
bin | 10110111111010110001000… |
… | …010000011000100000011001 |
3 | 111021000000212111012222001012 |
4 | 112333112020100120200121 |
5 | 101223042001421024233 |
6 | 555013202132303305 |
7 | 30203651544662132 |
oct | 2677261020304031 |
9 | 437000774188035 |
10 | 101110111111193 |
11 | 2a242614872708 |
12 | b40b997771b35 |
13 | 4455847942742 |
14 | 1ad7a810c2c89 |
15 | ba518cc7a548 |
hex | 5bf588418819 |
101110111111193 has 2 divisors, whose sum is σ = 101110111111194. Its totient is φ = 101110111111192.
The previous prime is 101110111111081. The next prime is 101110111111241. The reversal of 101110111111193 is 391111111011101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69206626178704 + 31903484932489 = 8319052^2 + 5648317^2 .
It is a cyclic number.
It is not a de Polignac number, because 101110111111193 - 214 = 101110111094809 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (101110111111993) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555055555596 + 50555055555597.
It is an arithmetic number, because the mean of its divisors is an integer number (50555055555597).
Almost surely, 2101110111111193 is an apocalyptic number.
It is an amenable number.
101110111111193 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110111111193 is an equidigital number, since it uses as much as digits as its factorization.
101110111111193 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 23.
Adding to 101110111111193 its reverse (391111111011101), we get a palindrome (492221222122294).
The spelling of 101110111111193 in words is "one hundred one trillion, one hundred ten billion, one hundred eleven million, one hundred eleven thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •