Base | Representation |
---|---|
bin | 100110111000010000011… |
… | …0110100000101001110101 |
3 | 200220211111001001021111011 |
4 | 1031300200312200221311 |
5 | 1200021432030223121 |
6 | 15210433213312221 |
7 | 1061024450432221 |
oct | 115604066405165 |
9 | 20824431037434 |
10 | 5343490476661 |
11 | 1780186084657 |
12 | 723730195671 |
13 | 2c9b7315911c |
14 | 1468aa895781 |
15 | 93ee30427e1 |
hex | 4dc20da0a75 |
5343490476661 has 2 divisors, whose sum is σ = 5343490476662. Its totient is φ = 5343490476660.
The previous prime is 5343490476637. The next prime is 5343490476691. The reversal of 5343490476661 is 1666740943435.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2904318090436 + 2439172386225 = 1704206^2 + 1561785^2 .
It is a cyclic number.
It is not a de Polignac number, because 5343490476661 - 25 = 5343490476629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5343490476596 and 5343490476605.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5343490476691) 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, 2671745238330 + 2671745238331.
It is an arithmetic number, because the mean of its divisors is an integer number (2671745238331).
Almost surely, 25343490476661 is an apocalyptic number.
It is an amenable number.
5343490476661 is a deficient number, since it is larger than the sum of its proper divisors (1).
5343490476661 is an equidigital number, since it uses as much as digits as its factorization.
5343490476661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39191040, while the sum is 58.
The spelling of 5343490476661 in words is "five trillion, three hundred forty-three billion, four hundred ninety million, four hundred seventy-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •