Base | Representation |
---|---|
bin | 100111100011101000000… |
… | …1001000101010110101001 |
3 | 201020201212210100101112022 |
4 | 1033013100021011112221 |
5 | 1203033202132442333 |
6 | 15321315031554225 |
7 | 1100532436506614 |
oct | 117072011052651 |
9 | 21221783311468 |
10 | 5436625671593 |
11 | 1806729506036 |
12 | 7397a2b2b975 |
13 | 305896679b1c |
14 | 14b1c3d0d17b |
15 | 9664476ac98 |
hex | 4f1d02455a9 |
5436625671593 has 2 divisors, whose sum is σ = 5436625671594. Its totient is φ = 5436625671592.
The previous prime is 5436625671583. The next prime is 5436625671601. The reversal of 5436625671593 is 3951765266345.
5436625671593 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5429398631449 + 7227040144 = 2330107^2 + 85012^2 .
It is a cyclic number.
It is not a de Polignac number, because 5436625671593 - 212 = 5436625667497 is a prime.
It is not a weakly prime, because it can be changed into another prime (5436625671583) 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, 2718312835796 + 2718312835797.
It is an arithmetic number, because the mean of its divisors is an integer number (2718312835797).
Almost surely, 25436625671593 is an apocalyptic number.
It is an amenable number.
5436625671593 is a deficient number, since it is larger than the sum of its proper divisors (1).
5436625671593 is an equidigital number, since it uses as much as digits as its factorization.
5436625671593 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 122472000, while the sum is 62.
The spelling of 5436625671593 in words is "five trillion, four hundred thirty-six billion, six hundred twenty-five million, six hundred seventy-one thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •