Base | Representation |
---|---|
bin | 101111101010100011100… |
… | …000011110101011111101 |
3 | 102121010122210201000112202 |
4 | 233222203200132223331 |
5 | 412131220104430221 |
6 | 10544425302041245 |
7 | 455435101666223 |
oct | 57524340365375 |
9 | 12533583630482 |
10 | 3275508280061 |
11 | 1053154039316 |
12 | 44a995119225 |
13 | 1a9b57519124 |
14 | b476d3a0b13 |
15 | 5a30bb81d0b |
hex | 2faa381eafd |
3275508280061 has 2 divisors, whose sum is σ = 3275508280062. Its totient is φ = 3275508280060.
The previous prime is 3275508280043. The next prime is 3275508280073. The reversal of 3275508280061 is 1600828055723.
3275508280061 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., 1671564552100 + 1603943727961 = 1292890^2 + 1266469^2 .
It is a cyclic number.
It is not a de Polignac number, because 3275508280061 - 210 = 3275508279037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3275508279988 and 3275508280015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3275508282061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1637754140030 + 1637754140031.
It is an arithmetic number, because the mean of its divisors is an integer number (1637754140031).
Almost surely, 23275508280061 is an apocalyptic number.
It is an amenable number.
3275508280061 is a deficient number, since it is larger than the sum of its proper divisors (1).
3275508280061 is an equidigital number, since it uses as much as digits as its factorization.
3275508280061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 806400, while the sum is 47.
The spelling of 3275508280061 in words is "three trillion, two hundred seventy-five billion, five hundred eight million, two hundred eighty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •