Base | Representation |
---|---|
bin | 10010000011110110110… |
… | …11001011001000001101 |
3 | 2012022201220210120221002 |
4 | 21001323123023020031 |
5 | 40131334234333121 |
6 | 1153024102350045 |
7 | 62555465032442 |
oct | 11017333131015 |
9 | 2168656716832 |
10 | 620546011661 |
11 | 21a199056224 |
12 | a032372b325 |
13 | 466954aa164 |
14 | 2206ac9b9c9 |
15 | 1121d9dee0b |
hex | 907b6cb20d |
620546011661 has 2 divisors, whose sum is σ = 620546011662. Its totient is φ = 620546011660.
The previous prime is 620546011601. The next prime is 620546011691. The reversal of 620546011661 is 166110645026.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 396988204900 + 223557806761 = 630070^2 + 472819^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-620546011661 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (620546011601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 310273005830 + 310273005831.
It is an arithmetic number, because the mean of its divisors is an integer number (310273005831).
Almost surely, 2620546011661 is an apocalyptic number.
It is an amenable number.
620546011661 is a deficient number, since it is larger than the sum of its proper divisors (1).
620546011661 is an equidigital number, since it uses as much as digits as its factorization.
620546011661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 38.
Adding to 620546011661 its reverse (166110645026), we get a palindrome (786656656687).
The spelling of 620546011661 in words is "six hundred twenty billion, five hundred forty-six million, eleven thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •