Base | Representation |
---|---|
bin | 1010101011010101… |
… | …1110011101110001 |
3 | 21101202011020222121 |
4 | 2222311132131301 |
5 | 21332213121022 |
6 | 1152223234241 |
7 | 131011555162 |
oct | 25265363561 |
9 | 7352136877 |
10 | 2866145137 |
11 | 1240956299 |
12 | 67ba48981 |
13 | 368a4928b |
14 | 1d2921769 |
15 | 11b9532c7 |
hex | aad5e771 |
2866145137 has 2 divisors, whose sum is σ = 2866145138. Its totient is φ = 2866145136.
The previous prime is 2866145131. The next prime is 2866145143. The reversal of 2866145137 is 7315416682.
It is a balanced prime because it is at equal distance from previous prime (2866145131) and next prime (2866145143).
It can be written as a sum of positive squares in only one way, i.e., 2796188641 + 69956496 = 52879^2 + 8364^2 .
It is a cyclic number.
It is not a de Polignac number, because 2866145137 - 223 = 2857756529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2866145093 and 2866145102.
It is not a weakly prime, because it can be changed into another prime (2866145131) 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, 1433072568 + 1433072569.
It is an arithmetic number, because the mean of its divisors is an integer number (1433072569).
Almost surely, 22866145137 is an apocalyptic number.
It is an amenable number.
2866145137 is a deficient number, since it is larger than the sum of its proper divisors (1).
2866145137 is an equidigital number, since it uses as much as digits as its factorization.
2866145137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 241920, while the sum is 43.
The square root of 2866145137 is about 53536.3907730060. The cubic root of 2866145137 is about 1420.4721594911.
The spelling of 2866145137 in words is "two billion, eight hundred sixty-six million, one hundred forty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •