Base | Representation |
---|---|
bin | 100100100100010010111… |
… | …0001010000110100010101 |
3 | 122210110022211122022202011 |
4 | 1021020211301100310111 |
5 | 1124320211311013003 |
6 | 14404443501544221 |
7 | 1026045441053404 |
oct | 111104561206425 |
9 | 18713284568664 |
10 | 5025745407253 |
11 | 166845229703a |
12 | 692033b75071 |
13 | 2a5c05b7795c |
14 | 135366b2763b |
15 | 8aae7a8546d |
hex | 49225c50d15 |
5025745407253 has 2 divisors, whose sum is σ = 5025745407254. Its totient is φ = 5025745407252.
The previous prime is 5025745407247. The next prime is 5025745407317. The reversal of 5025745407253 is 3527045475205.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4992154581969 + 33590825284 = 2234313^2 + 183278^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5025745407253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5025745407197 and 5025745407206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5025745407223) 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, 2512872703626 + 2512872703627.
It is an arithmetic number, because the mean of its divisors is an integer number (2512872703627).
Almost surely, 25025745407253 is an apocalyptic number.
It is an amenable number.
5025745407253 is a deficient number, since it is larger than the sum of its proper divisors (1).
5025745407253 is an equidigital number, since it uses as much as digits as its factorization.
5025745407253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5880000, while the sum is 49.
The spelling of 5025745407253 in words is "five trillion, twenty-five billion, seven hundred forty-five million, four hundred seven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •