Base | Representation |
---|---|
bin | 100010010110101… |
… | …1000001010011101 |
3 | 2222100002120102112 |
4 | 1010231120022131 |
5 | 4330100334031 |
6 | 310215203405 |
7 | 40365115631 |
oct | 10455301235 |
9 | 2870076375 |
10 | 1152746141 |
11 | 541771268 |
12 | 282076565 |
13 | 154a8b011 |
14 | ad14cdc1 |
15 | 6b30462b |
hex | 44b5829d |
1152746141 has 2 divisors, whose sum is σ = 1152746142. Its totient is φ = 1152746140.
The previous prime is 1152746113. The next prime is 1152746171. The reversal of 1152746141 is 1416472511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1152602500 + 143641 = 33950^2 + 379^2 .
It is a cyclic number.
It is not a de Polignac number, because 1152746141 - 222 = 1148551837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1152746098 and 1152746107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1152746171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 576373070 + 576373071.
It is an arithmetic number, because the mean of its divisors is an integer number (576373071).
Almost surely, 21152746141 is an apocalyptic number.
It is an amenable number.
1152746141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1152746141 is an equidigital number, since it uses as much as digits as its factorization.
1152746141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 6720, while the sum is 32.
The square root of 1152746141 is about 33952.1154127397. The cubic root of 1152746141 is about 1048.5228332139.
The spelling of 1152746141 in words is "one billion, one hundred fifty-two million, seven hundred forty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •