Base | Representation |
---|---|
bin | 1110111101101010111… |
… | …11110111000010110001 |
3 | 1211011002201122220001102 |
4 | 13132311133313002301 |
5 | 31410432402324431 |
6 | 1032110120014145 |
7 | 52101010023143 |
oct | 7366537670261 |
9 | 1734081586042 |
10 | 514146136241 |
11 | 1890590a9a91 |
12 | 8378a601355 |
13 | 39639b04caa |
14 | 1ac55c9ac93 |
15 | d5929d0dcb |
hex | 77b57f70b1 |
514146136241 has 2 divisors, whose sum is σ = 514146136242. Its totient is φ = 514146136240.
The previous prime is 514146136211. The next prime is 514146136247. The reversal of 514146136241 is 142631641415.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 503916836641 + 10229299600 = 709871^2 + 101140^2 .
It is a cyclic number.
It is not a de Polignac number, because 514146136241 - 238 = 239268229297 is a prime.
It is a super-2 number, since 2×5141461362412 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 514146136195 and 514146136204.
It is not a weakly prime, because it can be changed into another prime (514146136247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 257073068120 + 257073068121.
It is an arithmetic number, because the mean of its divisors is an integer number (257073068121).
Almost surely, 2514146136241 is an apocalyptic number.
It is an amenable number.
514146136241 is a deficient number, since it is larger than the sum of its proper divisors (1).
514146136241 is an equidigital number, since it uses as much as digits as its factorization.
514146136241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69120, while the sum is 38.
Adding to 514146136241 its reverse (142631641415), we get a palindrome (656777777656).
The spelling of 514146136241 in words is "five hundred fourteen billion, one hundred forty-six million, one hundred thirty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •