Base | Representation |
---|---|
bin | 110001110110000100011… |
… | …001100111110110100101 |
3 | 110010110022202112021101001 |
4 | 301312010121213312211 |
5 | 422110013410304021 |
6 | 11141322114033301 |
7 | 502320244453513 |
oct | 61660431476645 |
9 | 13113282467331 |
10 | 3425310244261 |
11 | 1100736376214 |
12 | 473a21578831 |
13 | 1bb00ba4b329 |
14 | bbb007214b3 |
15 | 5e178194091 |
hex | 31d84667da5 |
3425310244261 has 2 divisors, whose sum is σ = 3425310244262. Its totient is φ = 3425310244260.
The previous prime is 3425310244243. The next prime is 3425310244267. The reversal of 3425310244261 is 1624420135243.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3396446273025 + 28863971236 = 1842945^2 + 169894^2 .
It is a cyclic number.
It is not a de Polignac number, because 3425310244261 - 29 = 3425310243749 is a prime.
It is a super-2 number, since 2×34253102442612 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3425310244261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3425310244267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1712655122130 + 1712655122131.
It is an arithmetic number, because the mean of its divisors is an integer number (1712655122131).
Almost surely, 23425310244261 is an apocalyptic number.
It is an amenable number.
3425310244261 is a deficient number, since it is larger than the sum of its proper divisors (1).
3425310244261 is an equidigital number, since it uses as much as digits as its factorization.
3425310244261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 138240, while the sum is 37.
The spelling of 3425310244261 in words is "three trillion, four hundred twenty-five billion, three hundred ten million, two hundred forty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •