Base | Representation |
---|---|
bin | 110011001110010010… |
… | …0111001100100011001 |
3 | 101111221011110220202212 |
4 | 1212130210321210121 |
5 | 3300240240213311 |
6 | 122311145204505 |
7 | 10642633634414 |
oct | 1463444714431 |
9 | 344834426685 |
10 | 110001101081 |
11 | 427188323a3 |
12 | 1939b190735 |
13 | a4b07c4131 |
14 | 54773ccb7b |
15 | 2cdc263c8b |
hex | 199c939919 |
110001101081 has 2 divisors, whose sum is σ = 110001101082. Its totient is φ = 110001101080.
The previous prime is 110001101059. The next prime is 110001101083. The reversal of 110001101081 is 180101100011.
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., 73373265625 + 36627835456 = 270875^2 + 191384^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110001101081 is a prime.
It is a super-2 number, since 2×1100011010812 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 110001101083, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (110001101083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000550540 + 55000550541.
It is an arithmetic number, because the mean of its divisors is an integer number (55000550541).
Almost surely, 2110001101081 is an apocalyptic number.
It is an amenable number.
110001101081 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001101081 is an equidigital number, since it uses as much as digits as its factorization.
110001101081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110001101081 its reverse (180101100011), we get a palindrome (290102201092).
The spelling of 110001101081 in words is "one hundred ten billion, one million, one hundred one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •