Base | Representation |
---|---|
bin | 101111001011001111011… |
… | …101100110011110111001 |
3 | 102110220212121102110002002 |
4 | 233023033131212132321 |
5 | 411103340303002242 |
6 | 10521145111350345 |
7 | 453134646126413 |
oct | 57131735463671 |
9 | 12426777373062 |
10 | 3241885984697 |
11 | 103a970139158 |
12 | 4443710823b5 |
13 | 1a6929868ab9 |
14 | b2c9dc419b3 |
15 | 594e0040432 |
hex | 2f2cf7667b9 |
3241885984697 has 2 divisors, whose sum is σ = 3241885984698. Its totient is φ = 3241885984696.
The previous prime is 3241885984663. The next prime is 3241885984703. The reversal of 3241885984697 is 7964895881423.
3241885984697 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., 1761828820921 + 1480057163776 = 1327339^2 + 1216576^2 .
It is a cyclic number.
It is not a de Polignac number, because 3241885984697 - 26 = 3241885984633 is a prime.
It is a super-3 number, since 3×32418859846973 (a number of 39 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (3241885984637) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1620942992348 + 1620942992349.
It is an arithmetic number, because the mean of its divisors is an integer number (1620942992349).
Almost surely, 23241885984697 is an apocalyptic number.
It is an amenable number.
3241885984697 is a deficient number, since it is larger than the sum of its proper divisors (1).
3241885984697 is an equidigital number, since it uses as much as digits as its factorization.
3241885984697 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 836075520, while the sum is 74.
The spelling of 3241885984697 in words is "three trillion, two hundred forty-one billion, eight hundred eighty-five million, nine hundred eighty-four thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •