Base | Representation |
---|---|
bin | 100101111101100010010… |
… | …1000110110110001010101 |
3 | 200110202222211111220100012 |
4 | 1023323010220312301111 |
5 | 1140440203132414111 |
6 | 15032500252330005 |
7 | 1045641525451451 |
oct | 113730450666125 |
9 | 20422884456305 |
10 | 5217389341781 |
11 | 17317562a2601 |
12 | 7031b9173905 |
13 | 2bacc7c55a96 |
14 | 140747135661 |
15 | 90ab262848b |
hex | 4bec4a36c55 |
5217389341781 has 2 divisors, whose sum is σ = 5217389341782. Its totient is φ = 5217389341780.
The previous prime is 5217389341763. The next prime is 5217389341811. The reversal of 5217389341781 is 1871439837125.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3492540519556 + 1724848822225 = 1868834^2 + 1313335^2 .
It is a cyclic number.
It is not a de Polignac number, because 5217389341781 - 234 = 5200209472597 is a prime.
It is a super-2 number, since 2×52173893417812 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5217389341781.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5217389340781) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2608694670890 + 2608694670891.
It is an arithmetic number, because the mean of its divisors is an integer number (2608694670891).
Almost surely, 25217389341781 is an apocalyptic number.
It is an amenable number.
5217389341781 is a deficient number, since it is larger than the sum of its proper divisors (1).
5217389341781 is an equidigital number, since it uses as much as digits as its factorization.
5217389341781 is an evil number, because the sum of its binary digits is even.
The product of its digits is 10160640, while the sum is 59.
The spelling of 5217389341781 in words is "five trillion, two hundred seventeen billion, three hundred eighty-nine million, three hundred forty-one thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •