Base | Representation |
---|---|
bin | 101000101100110100001… |
… | …0011011011110110000001 |
3 | 201210202120100120122100011 |
4 | 1101121220103123312001 |
5 | 1213122044110012031 |
6 | 15521431030224521 |
7 | 1115065340624632 |
oct | 121315023336601 |
9 | 21722510518304 |
10 | 5593797344641 |
11 | 1867352853300 |
12 | 7641474b5141 |
13 | 31765397bbac |
14 | 154a53d47889 |
15 | 9a792c756b1 |
hex | 516684dbd81 |
5593797344641 has 27 divisors (see below), whose sum is σ = 6201011863683. Its totient is φ = 5042248762320.
The previous prime is 5593797344633. The next prime is 5593797344671. The reversal of 5593797344641 is 1464437973955.
The square root of 5593797344641 is 2365121.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2131205818225 + 3462591526416 = 1459865^2 + 1860804^2 .
It is not a de Polignac number, because 5593797344641 - 23 = 5593797344633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5593797344671) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 3304073191 + ... + 3304074883.
Almost surely, 25593797344641 is an apocalyptic number.
5593797344641 is the 2365121-st square number.
5593797344641 is the 1182561-st centered octagonal number.
It is an amenable number.
5593797344641 is a deficient number, since it is larger than the sum of its proper divisors (607214519042).
5593797344641 is an frugal number, since it uses more digits than its factorization.
5593797344641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3662 (or 1831 counting only the distinct ones).
The product of its digits is 342921600, while the sum is 67.
The spelling of 5593797344641 in words is "five trillion, five hundred ninety-three billion, seven hundred ninety-seven million, three hundred forty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •