Base | Representation |
---|---|
bin | 11110011110011… |
… | …111000011101101 |
3 | 1022122010010201211 |
4 | 132132133003231 |
5 | 2021343324023 |
6 | 122423034421 |
7 | 15446021626 |
oct | 3636370355 |
9 | 1278103654 |
10 | 511308013 |
11 | 242690307 |
12 | 12329ba11 |
13 | 81c14128 |
14 | 4bc9aa4d |
15 | 2ed4da0d |
hex | 1e79f0ed |
511308013 has 8 divisors (see below), whose sum is σ = 523584000. Its totient is φ = 499129488.
The previous prime is 511307989. The next prime is 511308029. The reversal of 511308013 is 310803115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 511308013 - 25 = 511307981 is a prime.
It is a super-2 number, since 2×5113080132 = 522871768316016338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (511308053) 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 in 7 ways as a sum of consecutive naturals, for example, 13693 + ... + 34786.
It is an arithmetic number, because the mean of its divisors is an integer number (65448000).
Almost surely, 2511308013 is an apocalyptic number.
511308013 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
511308013 is a deficient number, since it is larger than the sum of its proper divisors (12275987).
511308013 is a wasteful number, since it uses less digits than its factorization.
511308013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48731.
The product of its (nonzero) digits is 360, while the sum is 22.
The square root of 511308013 is about 22612.1209310405. The cubic root of 511308013 is about 799.6394276130.
The spelling of 511308013 in words is "five hundred eleven million, three hundred eight thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •