Base | Representation |
---|---|
bin | 101111110101010011110… |
… | …010101001101110110001 |
3 | 102122020110120100012201122 |
4 | 233311103302221232301 |
5 | 412323342234042442 |
6 | 10554015204512025 |
7 | 456324210013244 |
oct | 57652362515661 |
9 | 12566416305648 |
10 | 3287055768497 |
11 | 105803a319296 |
12 | 4510783ab615 |
13 | 1aac779b4a17 |
14 | b5146c6925b |
15 | 5a785819dd2 |
hex | 2fd53ca9bb1 |
3287055768497 has 2 divisors, whose sum is σ = 3287055768498. Its totient is φ = 3287055768496.
The previous prime is 3287055768467. The next prime is 3287055768617. The reversal of 3287055768497 is 7948675507823.
3287055768497 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2948257268401 + 338798500096 = 1717049^2 + 582064^2 .
It is a cyclic number.
It is not a de Polignac number, because 3287055768497 - 212 = 3287055764401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3287055768497.
It is not a weakly prime, because it can be changed into another prime (3287055768467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1643527884248 + 1643527884249.
It is an arithmetic number, because the mean of its divisors is an integer number (1643527884249).
Almost surely, 23287055768497 is an apocalyptic number.
It is an amenable number.
3287055768497 is a deficient number, since it is larger than the sum of its proper divisors (1).
3287055768497 is an equidigital number, since it uses as much as digits as its factorization.
3287055768497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 711244800, while the sum is 71.
The spelling of 3287055768497 in words is "three trillion, two hundred eighty-seven billion, fifty-five million, seven hundred sixty-eight thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •