Base | Representation |
---|---|
bin | 101111111101001011111… |
… | …001010110101001101101 |
3 | 102200001021222120101121012 |
4 | 233331023321112221231 |
5 | 412443202342222341 |
6 | 11001534325515005 |
7 | 460043614241114 |
oct | 57751371265155 |
9 | 12601258511535 |
10 | 3295513242221 |
11 | 106068a3474a2 |
12 | 452838872a65 |
13 | 1ab9c4c40545 |
14 | b570a1b8c7b |
15 | 5aacd07d0eb |
hex | 2ff4be56a6d |
3295513242221 has 2 divisors, whose sum is σ = 3295513242222. Its totient is φ = 3295513242220.
The previous prime is 3295513242199. The next prime is 3295513242223. The reversal of 3295513242221 is 1222423155923.
3295513242221 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., 3232354515625 + 63158726596 = 1797875^2 + 251314^2 .
It is a cyclic number.
It is not a de Polignac number, because 3295513242221 - 222 = 3295509047917 is a prime.
Together with 3295513242223, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3295513242223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1647756621110 + 1647756621111.
It is an arithmetic number, because the mean of its divisors is an integer number (1647756621111).
Almost surely, 23295513242221 is an apocalyptic number.
It is an amenable number.
3295513242221 is a deficient number, since it is larger than the sum of its proper divisors (1).
3295513242221 is an equidigital number, since it uses as much as digits as its factorization.
3295513242221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 259200, while the sum is 41.
The spelling of 3295513242221 in words is "three trillion, two hundred ninety-five billion, five hundred thirteen million, two hundred forty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •