Base | Representation |
---|---|
bin | 10001101000011110010… |
… | …00110110101100001101 |
3 | 2010220210100001201101112 |
4 | 20310033020312230031 |
5 | 34411232124240031 |
6 | 1142153203221405 |
7 | 61525250106125 |
oct | 10641710665415 |
9 | 2126710051345 |
10 | 605844368141 |
11 | 213a34395911 |
12 | 99500077865 |
13 | 45191704acc |
14 | 2147453dc85 |
15 | 10b5ceb262b |
hex | 8d0f236b0d |
605844368141 has 2 divisors, whose sum is σ = 605844368142. Its totient is φ = 605844368140.
The previous prime is 605844368117. The next prime is 605844368149. The reversal of 605844368141 is 141863448506.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 416836805641 + 189007562500 = 645629^2 + 434750^2 .
It is a cyclic number.
It is not a de Polignac number, because 605844368141 - 234 = 588664498957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 605844368141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (605844368149) 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, 302922184070 + 302922184071.
It is an arithmetic number, because the mean of its divisors is an integer number (302922184071).
Almost surely, 2605844368141 is an apocalyptic number.
It is an amenable number.
605844368141 is a deficient number, since it is larger than the sum of its proper divisors (1).
605844368141 is an equidigital number, since it uses as much as digits as its factorization.
605844368141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2211840, while the sum is 50.
The spelling of 605844368141 in words is "six hundred five billion, eight hundred forty-four million, three hundred sixty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •