Base | Representation |
---|---|
bin | 1011100111111011… |
… | …01110111101001011 |
3 | 121002220122210011001 |
4 | 11303331232331023 |
5 | 100240033432001 |
6 | 2511124115431 |
7 | 310434426514 |
oct | 56375567513 |
9 | 17086583131 |
10 | 6240530251 |
11 | 271268681a |
12 | 1261b35b77 |
13 | 785b74067 |
14 | 432b41a0b |
15 | 267ceb001 |
hex | 173f6ef4b |
6240530251 has 2 divisors, whose sum is σ = 6240530252. Its totient is φ = 6240530250.
The previous prime is 6240530171. The next prime is 6240530267. The reversal of 6240530251 is 1520350426.
6240530251 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6240530251 is a prime.
It is a super-2 number, since 2×62405302512 = 77888435627292246002, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (6240570251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3120265125 + 3120265126.
It is an arithmetic number, because the mean of its divisors is an integer number (3120265126).
Almost surely, 26240530251 is an apocalyptic number.
6240530251 is a deficient number, since it is larger than the sum of its proper divisors (1).
6240530251 is an equidigital number, since it uses as much as digits as its factorization.
6240530251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 6240530251 is about 78997.0268491163. The cubic root of 6240530251 is about 1841.0849629691.
Adding to 6240530251 its reverse (1520350426), we get a palindrome (7760880677).
The spelling of 6240530251 in words is "six billion, two hundred forty million, five hundred thirty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.860 sec. • engine limits •