Base | Representation |
---|---|
bin | 100010100101001… |
… | …1101111110101101 |
3 | 2222212110000022222 |
4 | 1011022131332231 |
5 | 4334023402031 |
6 | 311050445125 |
7 | 40520000105 |
oct | 10512357655 |
9 | 2885400288 |
10 | 1160372141 |
11 | 545aaa845 |
12 | 2847337a5 |
13 | 15652b146 |
14 | b0176205 |
15 | 6bd0de7b |
hex | 4529dfad |
1160372141 has 2 divisors, whose sum is σ = 1160372142. Its totient is φ = 1160372140.
The previous prime is 1160372137. The next prime is 1160372189. The reversal of 1160372141 is 1412730611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1159674916 + 697225 = 34054^2 + 835^2 .
It is an emirp because it is prime and its reverse (1412730611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1160372141 - 22 = 1160372137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1160372141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1160372131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 580186070 + 580186071.
It is an arithmetic number, because the mean of its divisors is an integer number (580186071).
Almost surely, 21160372141 is an apocalyptic number.
It is an amenable number.
1160372141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1160372141 is an equidigital number, since it uses as much as digits as its factorization.
1160372141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008, while the sum is 26.
The square root of 1160372141 is about 34064.2355117504. The cubic root of 1160372141 is about 1050.8299231429.
The spelling of 1160372141 in words is "one billion, one hundred sixty million, three hundred seventy-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •