Base | Representation |
---|---|
bin | 1110111000001011111… |
… | …11000101000011000100 |
3 | 1210212111111212101201221 |
4 | 13130011333011003010 |
5 | 31333420042430202 |
6 | 1030502010530124 |
7 | 51635023211353 |
oct | 7340577050304 |
9 | 1725444771657 |
10 | 511201530052 |
11 | 187887a33854 |
12 | 830a8436944 |
13 | 3928aa46c75 |
14 | 1aa56b9399a |
15 | d46e230037 |
hex | 7705fc50c4 |
511201530052 has 6 divisors (see below), whose sum is σ = 894602677598. Its totient is φ = 255600765024.
The previous prime is 511201529981. The next prime is 511201530079. The reversal of 511201530052 is 250035102115.
It can be written as a sum of positive squares in only one way, i.e., 450165851136 + 61035678916 = 670944^2 + 247054^2 .
It is a super-2 number, since 2×5112015300522 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 511201529999 and 511201530026.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 63900191253 + ... + 63900191260.
Almost surely, 2511201530052 is an apocalyptic number.
It is an amenable number.
511201530052 is a deficient number, since it is larger than the sum of its proper divisors (383401147546).
511201530052 is a wasteful number, since it uses less digits than its factorization.
511201530052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127800382517 (or 127800382515 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 511201530052 its reverse (250035102115), we get a palindrome (761236632167).
The spelling of 511201530052 in words is "five hundred eleven billion, two hundred one million, five hundred thirty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •