Base | Representation |
---|---|
bin | 100110110110110100101… |
… | …1001000100111101100101 |
3 | 200220112112112100102011102 |
4 | 1031231221121010331211 |
5 | 1144444131101434113 |
6 | 15205203542245445 |
7 | 1060555254346313 |
oct | 115555131047545 |
9 | 20815475312142 |
10 | 5340412530533 |
11 | 1779946716123 |
12 | 723011426885 |
13 | 2c97a2583322 |
14 | 146697b9d0b3 |
15 | 93db2c03758 |
hex | 4db69644f65 |
5340412530533 has 2 divisors, whose sum is σ = 5340412530534. Its totient is φ = 5340412530532.
The previous prime is 5340412530527. The next prime is 5340412530643. The reversal of 5340412530533 is 3350352140435.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3705343955329 + 1635068575204 = 1924927^2 + 1278698^2 .
It is a cyclic number.
It is not a de Polignac number, because 5340412530533 - 24 = 5340412530517 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5340412520533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2670206265266 + 2670206265267.
It is an arithmetic number, because the mean of its divisors is an integer number (2670206265267).
Almost surely, 25340412530533 is an apocalyptic number.
It is an amenable number.
5340412530533 is a deficient number, since it is larger than the sum of its proper divisors (1).
5340412530533 is an equidigital number, since it uses as much as digits as its factorization.
5340412530533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 38.
Adding to 5340412530533 its reverse (3350352140435), we get a palindrome (8690764670968).
The spelling of 5340412530533 in words is "five trillion, three hundred forty billion, four hundred twelve million, five hundred thirty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •