Base | Representation |
---|---|
bin | 100110110011111111100… |
… | …0111011001000100110101 |
3 | 200212221211221112121111221 |
4 | 1031213333013121010311 |
5 | 1144344204120322013 |
6 | 15202320502030341 |
7 | 1060251532323442 |
oct | 115477707310465 |
9 | 20787757477457 |
10 | 5334334542133 |
11 | 1777307868513 |
12 | 7219b5a183b1 |
13 | 2c90442ac99c |
14 | 14627c88c9c9 |
15 | 93b5931308d |
hex | 4d9ff1d9135 |
5334334542133 has 2 divisors, whose sum is σ = 5334334542134. Its totient is φ = 5334334542132.
The previous prime is 5334334542113. The next prime is 5334334542139. The reversal of 5334334542133 is 3312454334335.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3515782501764 + 1818552040369 = 1875042^2 + 1348537^2 .
It is a cyclic number.
It is not a de Polignac number, because 5334334542133 - 217 = 5334334411061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5334334542133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5334334542139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2667167271066 + 2667167271067.
It is an arithmetic number, because the mean of its divisors is an integer number (2667167271067).
Almost surely, 25334334542133 is an apocalyptic number.
It is an amenable number.
5334334542133 is a deficient number, since it is larger than the sum of its proper divisors (1).
5334334542133 is an equidigital number, since it uses as much as digits as its factorization.
5334334542133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2332800, while the sum is 43.
Adding to 5334334542133 its reverse (3312454334335), we get a palindrome (8646788876468).
The spelling of 5334334542133 in words is "five trillion, three hundred thirty-four billion, three hundred thirty-four million, five hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •