Base | Representation |
---|---|
bin | 1110110111110101110… |
… | …11110001001111110101 |
3 | 1210212000120222020112221 |
4 | 13123322323301033311 |
5 | 31333030111110031 |
6 | 1030431344442341 |
7 | 51630312202312 |
oct | 7337273611765 |
9 | 1725016866487 |
10 | 511016113141 |
11 | 1877a2301336 |
12 | 830563193b1 |
13 | 3925b4c7611 |
14 | 1aa3a2c9d09 |
15 | d45cd06a11 |
hex | 76faef13f5 |
511016113141 has 2 divisors, whose sum is σ = 511016113142. Its totient is φ = 511016113140.
The previous prime is 511016113121. The next prime is 511016113169. The reversal of 511016113141 is 141311610115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 294763212241 + 216252900900 = 542921^2 + 465030^2 .
It is a cyclic number.
It is not a de Polignac number, because 511016113141 - 211 = 511016111093 is a prime.
It is a super-2 number, since 2×5110161131412 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (511016113121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 255508056570 + 255508056571.
It is an arithmetic number, because the mean of its divisors is an integer number (255508056571).
Almost surely, 2511016113141 is an apocalyptic number.
It is an amenable number.
511016113141 is a deficient number, since it is larger than the sum of its proper divisors (1).
511016113141 is an equidigital number, since it uses as much as digits as its factorization.
511016113141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 25.
Adding to 511016113141 its reverse (141311610115), we get a palindrome (652327723256).
The spelling of 511016113141 in words is "five hundred eleven billion, sixteen million, one hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •