Base | Representation |
---|---|
bin | 111100101011111… |
… | …1001000011011101 |
3 | 12020220200001212222 |
4 | 1321113321003131 |
5 | 13132243244031 |
6 | 534021035125 |
7 | 101314213412 |
oct | 17127710335 |
9 | 5226601788 |
10 | 2036306141 |
11 | 955494a41 |
12 | 489b55aa5 |
13 | 265b4979c |
14 | 15462a109 |
15 | bdb84e7b |
hex | 795f90dd |
2036306141 has 2 divisors, whose sum is σ = 2036306142. Its totient is φ = 2036306140.
The previous prime is 2036306101. The next prime is 2036306177. The reversal of 2036306141 is 1416036302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1534994041 + 501312100 = 39179^2 + 22390^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2036306141 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2036306141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2036306101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1018153070 + 1018153071.
It is an arithmetic number, because the mean of its divisors is an integer number (1018153071).
Almost surely, 22036306141 is an apocalyptic number.
It is an amenable number.
2036306141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2036306141 is an equidigital number, since it uses as much as digits as its factorization.
2036306141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 2036306141 is about 45125.4489285148. The cubic root of 2036306141 is about 1267.4991895963.
The spelling of 2036306141 in words is "two billion, thirty-six million, three hundred six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •