Base | Representation |
---|---|
bin | 1001010111101010… |
… | …10000111010101111 |
3 | 110222120111021122012 |
4 | 10223311100322233 |
5 | 40300232204021 |
6 | 2151053511435 |
7 | 235441162634 |
oct | 45365207257 |
9 | 13876437565 |
10 | 5030350511 |
11 | 215155787a |
12 | b847a257b |
13 | 622227284 |
14 | 35a12218b |
15 | 1e694e35b |
hex | 12bd50eaf |
5030350511 has 2 divisors, whose sum is σ = 5030350512. Its totient is φ = 5030350510.
The previous prime is 5030350379. The next prime is 5030350513. The reversal of 5030350511 is 1150530305.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5030350511 - 222 = 5026156207 is a prime.
It is a super-2 number, since 2×50303505112 = 50608852527035922242, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 5030350513, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5030350513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2515175255 + 2515175256.
It is an arithmetic number, because the mean of its divisors is an integer number (2515175256).
Almost surely, 25030350511 is an apocalyptic number.
5030350511 is a deficient number, since it is larger than the sum of its proper divisors (1).
5030350511 is an equidigital number, since it uses as much as digits as its factorization.
5030350511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1125, while the sum is 23.
The square root of 5030350511 is about 70924.9639478231. The cubic root of 5030350511 is about 1713.4288791068.
Adding to 5030350511 its reverse (1150530305), we get a palindrome (6180880816).
The spelling of 5030350511 in words is "five billion, thirty million, three hundred fifty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •