Base | Representation |
---|---|
bin | 100001000000000… |
… | …0011111110011101 |
3 | 2212011121022020121 |
4 | 1002000003332131 |
5 | 4231433000131 |
6 | 301513314541 |
7 | 36304000306 |
oct | 10200037635 |
9 | 2764538217 |
10 | 1107312541 |
11 | 51905a335 |
12 | 26aa05a51 |
13 | 14854122a |
14 | a70c37ad |
15 | 6732c911 |
hex | 42003f9d |
1107312541 has 2 divisors, whose sum is σ = 1107312542. Its totient is φ = 1107312540.
The previous prime is 1107312509. The next prime is 1107312553. The reversal of 1107312541 is 1452137011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 726086916 + 381225625 = 26946^2 + 19525^2 .
It is a cyclic number.
It is not a de Polignac number, because 1107312541 - 25 = 1107312509 is a prime.
It is a super-2 number, since 2×11073125412 = 2452282126911753362, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1107312581) 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, 553656270 + 553656271.
It is an arithmetic number, because the mean of its divisors is an integer number (553656271).
Almost surely, 21107312541 is an apocalyptic number.
It is an amenable number.
1107312541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1107312541 is an equidigital number, since it uses as much as digits as its factorization.
1107312541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
The square root of 1107312541 is about 33276.3059999153. The cubic root of 1107312541 is about 1034.5625169980.
Adding to 1107312541 its reverse (1452137011), we get a palindrome (2559449552).
The spelling of 1107312541 in words is "one billion, one hundred seven million, three hundred twelve thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •