Base | Representation |
---|---|
bin | 100000111100000… |
… | …1010101111111101 |
3 | 2212000201011112212 |
4 | 1001320022233331 |
5 | 4230420240013 |
6 | 301401110205 |
7 | 36250261121 |
oct | 10170125775 |
9 | 2760634485 |
10 | 1105243133 |
11 | 517976585 |
12 | 26a188365 |
13 | 147c98327 |
14 | a6b05581 |
15 | 6706e6a8 |
hex | 41e0abfd |
1105243133 has 2 divisors, whose sum is σ = 1105243134. Its totient is φ = 1105243132.
The previous prime is 1105243103. The next prime is 1105243159. The reversal of 1105243133 is 3313425011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 725655844 + 379587289 = 26938^2 + 19483^2 .
It is a cyclic number.
It is not a de Polignac number, because 1105243133 - 226 = 1038134269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1105243099 and 1105243108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105243103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552621566 + 552621567.
It is an arithmetic number, because the mean of its divisors is an integer number (552621567).
Almost surely, 21105243133 is an apocalyptic number.
It is an amenable number.
1105243133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105243133 is an equidigital number, since it uses as much as digits as its factorization.
1105243133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 1105243133 is about 33245.1971418429. The cubic root of 1105243133 is about 1033.9176322118.
Adding to 1105243133 its reverse (3313425011), we get a palindrome (4418668144).
The spelling of 1105243133 in words is "one billion, one hundred five million, two hundred forty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •