Base | Representation |
---|---|
bin | 100101010110100010000… |
… | …0011001001010011100001 |
3 | 200011202210100000020102121 |
4 | 1022231010003021103201 |
5 | 1133102132131001303 |
6 | 14530204515344241 |
7 | 1036615035366145 |
oct | 112550403112341 |
9 | 20152710006377 |
10 | 5133627593953 |
11 | 16aa182a41721 |
12 | 6aab215b2081 |
13 | 2b313968a9a1 |
14 | 13a67c945225 |
15 | 8d80dc979bd |
hex | 4ab440c94e1 |
5133627593953 has 2 divisors, whose sum is σ = 5133627593954. Its totient is φ = 5133627593952.
The previous prime is 5133627593923. The next prime is 5133627594013. The reversal of 5133627593953 is 3593957263315.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5132997734544 + 629859409 = 2265612^2 + 25097^2 .
It is a cyclic number.
It is not a de Polignac number, because 5133627593953 - 237 = 4996188640481 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5133627593891 and 5133627593900.
It is not a weakly prime, because it can be changed into another prime (5133627593923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2566813796976 + 2566813796977.
It is an arithmetic number, because the mean of its divisors is an integer number (2566813796977).
Almost surely, 25133627593953 is an apocalyptic number.
It is an amenable number.
5133627593953 is a deficient number, since it is larger than the sum of its proper divisors (1).
5133627593953 is an equidigital number, since it uses as much as digits as its factorization.
5133627593953 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 68890500, while the sum is 61.
The spelling of 5133627593953 in words is "five trillion, one hundred thirty-three billion, six hundred twenty-seven million, five hundred ninety-three thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •