Base | Representation |
---|---|
bin | 100010010111110… |
… | …0101100001010101 |
3 | 2222101011222122222 |
4 | 1010233211201111 |
5 | 4330222401031 |
6 | 310235432125 |
7 | 40403046653 |
oct | 10457454125 |
9 | 2871158588 |
10 | 1153325141 |
11 | 542027281 |
12 | 2822b5645 |
13 | 154c31717 |
14 | ad25ddd3 |
15 | 6b3bae7b |
hex | 44be5855 |
1153325141 has 2 divisors, whose sum is σ = 1153325142. Its totient is φ = 1153325140.
The previous prime is 1153325111. The next prime is 1153325143. The reversal of 1153325141 is 1415233511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1132659025 + 20666116 = 33655^2 + 4546^2 .
It is a cyclic number.
It is not a de Polignac number, because 1153325141 - 26 = 1153325077 is a prime.
Together with 1153325143, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1153325141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1153325143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 576662570 + 576662571.
It is an arithmetic number, because the mean of its divisors is an integer number (576662571).
Almost surely, 21153325141 is an apocalyptic number.
It is an amenable number.
1153325141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1153325141 is an equidigital number, since it uses as much as digits as its factorization.
1153325141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1800, while the sum is 26.
The square root of 1153325141 is about 33960.6410569648. The cubic root of 1153325141 is about 1048.6983541094.
Adding to 1153325141 its reverse (1415233511), we get a palindrome (2568558652).
The spelling of 1153325141 in words is "one billion, one hundred fifty-three million, three hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •