Base | Representation |
---|---|
bin | 11110011101101… |
… | …101110000000101 |
3 | 1022121201212200211 |
4 | 132131231300011 |
5 | 2021320343203 |
6 | 122414435421 |
7 | 15444221053 |
oct | 3635556005 |
9 | 1277655624 |
10 | 511106053 |
11 | 2425625a7 |
12 | 123202b71 |
13 | 81b73223 |
14 | 4bc471d3 |
15 | 2ed0dc6d |
hex | 1e76dc05 |
511106053 has 4 divisors (see below), whose sum is σ = 511151680. Its totient is φ = 511060428.
The previous prime is 511106051. The next prime is 511106077. The reversal of 511106053 is 350601115.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 511106053 - 21 = 511106051 is a prime.
It is a super-2 number, since 2×5111060532 = 522458794826477618, 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 (511106051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6826 + ... + 32692.
It is an arithmetic number, because the mean of its divisors is an integer number (127787920).
Almost surely, 2511106053 is an apocalyptic number.
It is an amenable number.
511106053 is a deficient number, since it is larger than the sum of its proper divisors (45627).
511106053 is a wasteful number, since it uses less digits than its factorization.
511106053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45626.
The product of its (nonzero) digits is 450, while the sum is 22.
The square root of 511106053 is about 22607.6547434713. The cubic root of 511106053 is about 799.5341313648.
Adding to 511106053 its reverse (350601115), we get a palindrome (861707168).
The spelling of 511106053 in words is "five hundred eleven million, one hundred six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •