Base | Representation |
---|---|
bin | 100000111100001… |
… | …1011001010000101 |
3 | 2212000211120202001 |
4 | 1001320123022011 |
5 | 4230424412331 |
6 | 301402345301 |
7 | 36250661062 |
oct | 10170331205 |
9 | 2760746661 |
10 | 1105310341 |
11 | 517a12023 |
12 | 26a1bb231 |
13 | 147cbcab5 |
14 | a6b21c69 |
15 | 67084561 |
hex | 41e1b285 |
1105310341 has 2 divisors, whose sum is σ = 1105310342. Its totient is φ = 1105310340.
The previous prime is 1105310317. The next prime is 1105310473. The reversal of 1105310341 is 1430135011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 792197316 + 313113025 = 28146^2 + 17695^2 .
It is an emirp because it is prime and its reverse (1430135011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1105310341 - 229 = 568439429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105311341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552655170 + 552655171.
It is an arithmetic number, because the mean of its divisors is an integer number (552655171).
Almost surely, 21105310341 is an apocalyptic number.
It is an amenable number.
1105310341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105310341 is an equidigital number, since it uses as much as digits as its factorization.
1105310341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 1105310341 is about 33246.2079190996. The cubic root of 1105310341 is about 1033.9385887253.
Adding to 1105310341 its reverse (1430135011), we get a palindrome (2535445352).
The spelling of 1105310341 in words is "one billion, one hundred five million, three hundred ten thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •