Base | Representation |
---|---|
bin | 100000111011110… |
… | …1011000010011001 |
3 | 2212000110120101001 |
4 | 1001313223002121 |
5 | 4230402110431 |
6 | 301354225001 |
7 | 36246210331 |
oct | 10167530231 |
9 | 2760416331 |
10 | 1105113241 |
11 | 517897a31 |
12 | 26a125161 |
13 | 147c5117b |
14 | a6ab00c1 |
15 | 67045e61 |
hex | 41deb099 |
1105113241 has 2 divisors, whose sum is σ = 1105113242. Its totient is φ = 1105113240.
The previous prime is 1105113239. The next prime is 1105113257. The reversal of 1105113241 is 1423115011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 933608025 + 171505216 = 30555^2 + 13096^2 .
It is an emirp because it is prime and its reverse (1423115011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1105113241 - 21 = 1105113239 is a prime.
It is a super-3 number, since 3×11051132413 (a number of 28 digits) contains 333 as substring.
Together with 1105113239, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1105113941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552556620 + 552556621.
It is an arithmetic number, because the mean of its divisors is an integer number (552556621).
Almost surely, 21105113241 is an apocalyptic number.
It is an amenable number.
1105113241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105113241 is an equidigital number, since it uses as much as digits as its factorization.
1105113241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 19.
The square root of 1105113241 is about 33243.2435391013. The cubic root of 1105113241 is about 1033.8771274316.
Adding to 1105113241 its reverse (1423115011), we get a palindrome (2528228252).
The spelling of 1105113241 in words is "one billion, one hundred five million, one hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •