Base | Representation |
---|---|
bin | 100000110100000… |
… | …0001100011000101 |
3 | 2211201202011100102 |
4 | 1001220001203011 |
5 | 4223324324031 |
6 | 301130253445 |
7 | 36166304006 |
oct | 10150014305 |
9 | 2751664312 |
10 | 1101011141 |
11 | 515545a6a |
12 | 268887285 |
13 | 147145ca9 |
14 | a63231ad |
15 | 669d57cb |
hex | 41a018c5 |
1101011141 has 2 divisors, whose sum is σ = 1101011142. Its totient is φ = 1101011140.
The previous prime is 1101011123. The next prime is 1101011147. The reversal of 1101011141 is 1411101011.
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., 752404900 + 348606241 = 27430^2 + 18671^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101011141 - 230 = 27269317 is a prime.
It is a super-2 number, since 2×11010111412 = 2424451065212243762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101011147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505570 + 550505571.
It is an arithmetic number, because the mean of its divisors is an integer number (550505571).
Almost surely, 21101011141 is an apocalyptic number.
It is an amenable number.
1101011141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101011141 is an equidigital number, since it uses as much as digits as its factorization.
1101011141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
The square root of 1101011141 is about 33181.4879262519. The cubic root of 1101011141 is about 1032.5963157868.
Adding to 1101011141 its reverse (1411101011), we get a palindrome (2512112152).
It can be divided in two parts, 1101011 and 141, that multiplied together give a palindrome (155242551).
The spelling of 1101011141 in words is "one billion, one hundred one million, eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •