Base | Representation |
---|---|
bin | 110111001010111001010111… |
… | …1000100100001110010100101 |
3 | 2100122020120110212222220001101 |
4 | 1232111302233010201302211 |
5 | 1002101332433210241404 |
6 | 4440035443510000101 |
7 | 204134342514365062 |
oct | 15625625704416245 |
9 | 2318216425886041 |
10 | 485282702040229 |
11 | 13069826900a375 |
12 | 46517057046031 |
13 | 17aa1c68647472 |
14 | 87b9b45605c69 |
15 | 3b184b40162a4 |
hex | 1b95caf121ca5 |
485282702040229 has 2 divisors, whose sum is σ = 485282702040230. Its totient is φ = 485282702040228.
The previous prime is 485282702040139. The next prime is 485282702040281. The reversal of 485282702040229 is 922040207282584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 470687994669025 + 14594707371204 = 21695345^2 + 3820302^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-485282702040229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 485282702040229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (485282702040029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 242641351020114 + 242641351020115.
It is an arithmetic number, because the mean of its divisors is an integer number (242641351020115).
Almost surely, 2485282702040229 is an apocalyptic number.
It is an amenable number.
485282702040229 is a deficient number, since it is larger than the sum of its proper divisors (1).
485282702040229 is an equidigital number, since it uses as much as digits as its factorization.
485282702040229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10321920, while the sum is 55.
The spelling of 485282702040229 in words is "four hundred eighty-five trillion, two hundred eighty-two billion, seven hundred two million, forty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •