Base | Representation |
---|---|
bin | 10010001100110101101… |
… | …11100100100110111001 |
3 | 2012210012000012020122202 |
4 | 21012122313210212321 |
5 | 40221223320021144 |
6 | 1155142413355545 |
7 | 63116133455063 |
oct | 11063267444671 |
9 | 2183160166582 |
10 | 625368517049 |
11 | 221243251971 |
12 | a124a798bb5 |
13 | 46c83631343 |
14 | 223a7558733 |
15 | 1140208564e |
hex | 919ade49b9 |
625368517049 has 2 divisors, whose sum is σ = 625368517050. Its totient is φ = 625368517048.
The previous prime is 625368516959. The next prime is 625368517051. The reversal of 625368517049 is 940715863526.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 558056809024 + 67311708025 = 747032^2 + 259445^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-625368517049 is a prime.
Together with 625368517051, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 625368516985 and 625368517003.
It is not a weakly prime, because it can be changed into another prime (625368517079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 312684258524 + 312684258525.
It is an arithmetic number, because the mean of its divisors is an integer number (312684258525).
It is a 1-persistent number, because it is pandigital, but 2⋅625368517049 = 1250737034098 is not.
Almost surely, 2625368517049 is an apocalyptic number.
It is an amenable number.
625368517049 is a deficient number, since it is larger than the sum of its proper divisors (1).
625368517049 is an equidigital number, since it uses as much as digits as its factorization.
625368517049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10886400, while the sum is 56.
The spelling of 625368517049 in words is "six hundred twenty-five billion, three hundred sixty-eight million, five hundred seventeen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •