Base | Representation |
---|---|
bin | 100100110001001000100… |
… | …0000000001001100110101 |
3 | 122220002111011021012110001 |
4 | 1021202101000001030311 |
5 | 1130243141421210313 |
6 | 14425243245431301 |
7 | 1031042560223101 |
oct | 111422100011465 |
9 | 18802434235401 |
10 | 5053314241333 |
11 | 167910a171136 |
12 | 69744886b531 |
13 | 2a86aa661527 |
14 | 13682031c901 |
15 | 8b6ad02dadd |
hex | 49891001335 |
5053314241333 has 2 divisors, whose sum is σ = 5053314241334. Its totient is φ = 5053314241332.
The previous prime is 5053314241289. The next prime is 5053314241357. The reversal of 5053314241333 is 3331424133505.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2618160233329 + 2435154008004 = 1618073^2 + 1560498^2 .
It is a cyclic number.
It is not a de Polignac number, because 5053314241333 - 237 = 4915875287861 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5053314241292 and 5053314241301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5053314241373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2526657120666 + 2526657120667.
It is an arithmetic number, because the mean of its divisors is an integer number (2526657120667).
Almost surely, 25053314241333 is an apocalyptic number.
It is an amenable number.
5053314241333 is a deficient number, since it is larger than the sum of its proper divisors (1).
5053314241333 is an equidigital number, since it uses as much as digits as its factorization.
5053314241333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 194400, while the sum is 37.
Adding to 5053314241333 its reverse (3331424133505), we get a palindrome (8384738374838).
The spelling of 5053314241333 in words is "five trillion, fifty-three billion, three hundred fourteen million, two hundred forty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •