Base | Representation |
---|---|
bin | 1001010111101101… |
… | …01001000010000101 |
3 | 110222121011121201112 |
4 | 10223312221002011 |
5 | 40300330231204 |
6 | 2151105334405 |
7 | 235444225112 |
oct | 45366510205 |
9 | 13877147645 |
10 | 5030711429 |
11 | 2151783a57 |
12 | b84937405 |
13 | 622322633 |
14 | 35a1b7909 |
15 | 1e69c126e |
hex | 12bda9085 |
5030711429 has 2 divisors, whose sum is σ = 5030711430. Its totient is φ = 5030711428.
The previous prime is 5030711311. The next prime is 5030711447. The reversal of 5030711429 is 9241170305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3763209025 + 1267502404 = 61345^2 + 35602^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5030711429 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5030711395 and 5030711404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5030711459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2515355714 + 2515355715.
It is an arithmetic number, because the mean of its divisors is an integer number (2515355715).
Almost surely, 25030711429 is an apocalyptic number.
It is an amenable number.
5030711429 is a deficient number, since it is larger than the sum of its proper divisors (1).
5030711429 is an equidigital number, since it uses as much as digits as its factorization.
5030711429 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 32.
The square root of 5030711429 is about 70927.5082672442. The cubic root of 5030711429 is about 1713.4698565386.
The spelling of 5030711429 in words is "five billion, thirty million, seven hundred eleven thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •