Base | Representation |
---|---|
bin | 11001011000000… |
… | …010000100001001 |
3 | 1002200002100012101 |
4 | 121120002010021 |
5 | 1332441332223 |
6 | 110124513401 |
7 | 13356435151 |
oct | 3130020411 |
9 | 1080070171 |
10 | 425730313 |
11 | 1a934a538 |
12 | ba6ab861 |
13 | 6a280038 |
14 | 40781761 |
15 | 275974ad |
hex | 19602109 |
425730313 has 2 divisors, whose sum is σ = 425730314. Its totient is φ = 425730312.
The previous prime is 425730307. The next prime is 425730341. The reversal of 425730313 is 313037524.
It is an a-pointer prime, because the next prime (425730341) can be obtained adding 425730313 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 363588624 + 62141689 = 19068^2 + 7883^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-425730313 is a prime.
It is equal to p22633390 and since 425730313 and 22633390 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (425730373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 212865156 + 212865157.
It is an arithmetic number, because the mean of its divisors is an integer number (212865157).
Almost surely, 2425730313 is an apocalyptic number.
It is an amenable number.
425730313 is a deficient number, since it is larger than the sum of its proper divisors (1).
425730313 is an equidigital number, since it uses as much as digits as its factorization.
425730313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 28.
The square root of 425730313 is about 20633.2332173123. The cubic root of 425730313 is about 752.2777056660.
Adding to 425730313 its reverse (313037524), we get a palindrome (738767837).
The spelling of 425730313 in words is "four hundred twenty-five million, seven hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •