Base | Representation |
---|---|
bin | 11110011101110… |
… | …110001000101101 |
3 | 1022121210121210211 |
4 | 132131312020231 |
5 | 2021322443042 |
6 | 122415302421 |
7 | 15444423145 |
oct | 3635661055 |
9 | 1277717724 |
10 | 511140397 |
11 | 242586389 |
12 | 12321aa11 |
13 | 81b85a51 |
14 | 4bc55925 |
15 | 2ed19017 |
hex | 1e77622d |
511140397 has 2 divisors, whose sum is σ = 511140398. Its totient is φ = 511140396.
The previous prime is 511140389. The next prime is 511140401. The reversal of 511140397 is 793041115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 381772521 + 129367876 = 19539^2 + 11374^2 .
It is a cyclic number.
It is not a de Polignac number, because 511140397 - 23 = 511140389 is a prime.
It is a super-2 number, since 2×5111403972 = 522529010890635218, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (511140367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 255570198 + 255570199.
It is an arithmetic number, because the mean of its divisors is an integer number (255570199).
Almost surely, 2511140397 is an apocalyptic number.
It is an amenable number.
511140397 is a deficient number, since it is larger than the sum of its proper divisors (1).
511140397 is an equidigital number, since it uses as much as digits as its factorization.
511140397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 31.
The square root of 511140397 is about 22608.4142964517. The cubic root of 511140397 is about 799.5520393150.
The spelling of 511140397 in words is "five hundred eleven million, one hundred forty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •