Base | Representation |
---|---|
bin | 111100111110111010010011… |
… | …0000110011001001101111101 |
3 | 2121100021111002212010200111122 |
4 | 1321331310212012121031331 |
5 | 1030302033223331202233 |
6 | 5140504133253200325 |
7 | 220662326105664206 |
oct | 17175644606311575 |
9 | 2540244085120448 |
10 | 536411989709693 |
11 | 145a10057a60a59 |
12 | 501b42a20300a5 |
13 | 1a040583771b26 |
14 | 966669bc985ad |
15 | 4203490944d98 |
hex | 1e7dd2619937d |
536411989709693 has 2 divisors, whose sum is σ = 536411989709694. Its totient is φ = 536411989709692.
The previous prime is 536411989709527. The next prime is 536411989709719. The reversal of 536411989709693 is 396907989114635.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 476048382272089 + 60363607437604 = 21818533^2 + 7769402^2 .
It is a cyclic number.
It is not a de Polignac number, because 536411989709693 - 232 = 536407694742397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (536413989709693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 268205994854846 + 268205994854847.
It is an arithmetic number, because the mean of its divisors is an integer number (268205994854847).
Almost surely, 2536411989709693 is an apocalyptic number.
It is an amenable number.
536411989709693 is a deficient number, since it is larger than the sum of its proper divisors (1).
536411989709693 is an equidigital number, since it uses as much as digits as its factorization.
536411989709693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2380855680, while the sum is 80.
The spelling of 536411989709693 in words is "five hundred thirty-six trillion, four hundred eleven billion, nine hundred eighty-nine million, seven hundred nine thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •