Base | Representation |
---|---|
bin | 101100110101011001100… |
… | …0010011001110111101001 |
3 | 210211002011110101100201022 |
4 | 1121222303002121313221 |
5 | 1301424222113320002 |
6 | 21034435551302225 |
7 | 1204121531025554 |
oct | 131526302316751 |
9 | 23732143340638 |
10 | 6161986854377 |
11 | 1a66313a33722 |
12 | 836298b1a975 |
13 | 3590c41204a3 |
14 | 17435553969b |
15 | aa44a08cba2 |
hex | 59ab3099de9 |
6161986854377 has 2 divisors, whose sum is σ = 6161986854378. Its totient is φ = 6161986854376.
The previous prime is 6161986854329. The next prime is 6161986854383. The reversal of 6161986854377 is 7734586891616.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5315680691776 + 846306162601 = 2305576^2 + 919949^2 .
It is a cyclic number.
It is not a de Polignac number, because 6161986854377 - 26 = 6161986854313 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6161986854377.
It is not a weakly prime, because it can be changed into another prime (6161916854377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3080993427188 + 3080993427189.
It is an arithmetic number, because the mean of its divisors is an integer number (3080993427189).
Almost surely, 26161986854377 is an apocalyptic number.
It is an amenable number.
6161986854377 is a deficient number, since it is larger than the sum of its proper divisors (1).
6161986854377 is an equidigital number, since it uses as much as digits as its factorization.
6161986854377 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 365783040, while the sum is 71.
The spelling of 6161986854377 in words is "six trillion, one hundred sixty-one billion, nine hundred eighty-six million, eight hundred fifty-four thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •