Base | Representation |
---|---|
bin | 11110011110011… |
… | …100001011110010 |
3 | 1022122002112120212 |
4 | 132132130023302 |
5 | 2021342434432 |
6 | 122422504122 |
7 | 15445642412 |
oct | 3636341362 |
9 | 1278075525 |
10 | 511296242 |
11 | 242682486 |
12 | 123295042 |
13 | 81c0b972 |
14 | 4bc96642 |
15 | 2ed4a2b2 |
hex | 1e79c2f2 |
511296242 has 18 divisors (see below), whose sum is σ = 783053199. Its totient is φ = 250387740.
The previous prime is 511296241. The next prime is 511296257. The reversal of 511296242 is 242692115.
It can be written as a sum of positive squares in only one way, i.e., 255648121 + 255648121 = 15989^2 + 15989^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=15989.
It is a super-2 number, since 2×5112962422 = 522847694166645128, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 511296199 and 511296208.
It is not an unprimeable number, because it can be changed into a prime (511296241) 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 in 8 ways as a sum of consecutive naturals, for example, 1886567 + ... + 1886837.
Almost surely, 2511296242 is an apocalyptic number.
511296242 is a deficient number, since it is larger than the sum of its proper divisors (271756957).
511296242 is an frugal number, since it uses more digits than its factorization.
511296242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662 (or 332 counting only the distinct ones).
The product of its digits is 8640, while the sum is 32.
The square root of 511296242 is about 22611.8606487834. The cubic root of 511296242 is about 799.6332913066.
Multiplying 511296242 by its sum of digits (32), we get a square (16361479744 = 1279122).
The spelling of 511296242 in words is "five hundred eleven million, two hundred ninety-six thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •