Base | Representation |
---|---|
bin | 100111001001100111110… |
… | …1100111010110101110101 |
3 | 201001101202001212000011212 |
4 | 1032103033230322311311 |
5 | 1201124321112314103 |
6 | 15235521541011205 |
7 | 1063514556631535 |
oct | 116231754726565 |
9 | 21041661760155 |
10 | 5380783713653 |
11 | 1794a83147577 |
12 | 72a9b96b3b05 |
13 | 3005374c786a |
14 | 14860778d4c5 |
15 | 94e770aa7d8 |
hex | 4e4cfb3ad75 |
5380783713653 has 2 divisors, whose sum is σ = 5380783713654. Its totient is φ = 5380783713652.
The previous prime is 5380783713649. The next prime is 5380783713677. The reversal of 5380783713653 is 3563173870835.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2726484556849 + 2654299156804 = 1651207^2 + 1629202^2 .
It is a cyclic number.
It is not a de Polignac number, because 5380783713653 - 22 = 5380783713649 is a prime.
It is a super-2 number, since 2×53807837136532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5380783713592 and 5380783713601.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5380783713353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2690391856826 + 2690391856827.
It is an arithmetic number, because the mean of its divisors is an integer number (2690391856827).
Almost surely, 25380783713653 is an apocalyptic number.
It is an amenable number.
5380783713653 is a deficient number, since it is larger than the sum of its proper divisors (1).
5380783713653 is an equidigital number, since it uses as much as digits as its factorization.
5380783713653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38102400, while the sum is 59.
The spelling of 5380783713653 in words is "five trillion, three hundred eighty billion, seven hundred eighty-three million, seven hundred thirteen thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •