Base | Representation |
---|---|
bin | 110111100111011010101001… |
… | …1001010010000101111110101 |
3 | 2101011010022001220212210201222 |
4 | 1233032311103022100233311 |
5 | 1003110043122041240121 |
6 | 4452240302053400125 |
7 | 205020466063344011 |
oct | 15716652312205765 |
9 | 2334108056783658 |
10 | 489202465180661 |
11 | 131969667126851 |
12 | 46a4a86b939045 |
13 | 17cc77962197ab |
14 | 88b3750551541 |
15 | 3b8542ad170ab |
hex | 1bced53290bf5 |
489202465180661 has 2 divisors, whose sum is σ = 489202465180662. Its totient is φ = 489202465180660.
The previous prime is 489202465180643. The next prime is 489202465180669. The reversal of 489202465180661 is 166081564202984.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 434305850080036 + 54896615100625 = 20840006^2 + 7409225^2 .
It is a cyclic number.
It is not a de Polignac number, because 489202465180661 - 226 = 489202398071797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 489202465180594 and 489202465180603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (489202465180669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 244601232590330 + 244601232590331.
It is an arithmetic number, because the mean of its divisors is an integer number (244601232590331).
Almost surely, 2489202465180661 is an apocalyptic number.
It is an amenable number.
489202465180661 is a deficient number, since it is larger than the sum of its proper divisors (1).
489202465180661 is an equidigital number, since it uses as much as digits as its factorization.
489202465180661 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 39813120, while the sum is 62.
The spelling of 489202465180661 in words is "four hundred eighty-nine trillion, two hundred two billion, four hundred sixty-five million, one hundred eighty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •