Base | Representation |
---|---|
bin | 101001001000011011110… |
… | …100010110011110010001 |
3 | 101000012211111020222012022 |
4 | 221020123310112132101 |
5 | 332302241112023022 |
6 | 10002300155141225 |
7 | 411132446455421 |
oct | 51103364263621 |
9 | 11005744228168 |
10 | 2826555189137 |
11 | 99a80a797189 |
12 | 39797b744815 |
13 | 176709cc07c4 |
14 | 9ab3d94a481 |
15 | 4d7d278dc42 |
hex | 2921bd16791 |
2826555189137 has 2 divisors, whose sum is σ = 2826555189138. Its totient is φ = 2826555189136.
The previous prime is 2826555189113. The next prime is 2826555189149. The reversal of 2826555189137 is 7319815556282.
2826555189137 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2740849113601 + 85706075536 = 1655551^2 + 292756^2 .
It is a cyclic number.
It is not a de Polignac number, because 2826555189137 - 240 = 1727043561361 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2826555189137.
It is not a weakly prime, because it can be changed into another prime (2826555189937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1413277594568 + 1413277594569.
It is an arithmetic number, because the mean of its divisors is an integer number (1413277594569).
Almost surely, 22826555189137 is an apocalyptic number.
It is an amenable number.
2826555189137 is a deficient number, since it is larger than the sum of its proper divisors (1).
2826555189137 is an equidigital number, since it uses as much as digits as its factorization.
2826555189137 is an evil number, because the sum of its binary digits is even.
The product of its digits is 36288000, while the sum is 62.
The spelling of 2826555189137 in words is "two trillion, eight hundred twenty-six billion, five hundred fifty-five million, one hundred eighty-nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •