Base | Representation |
---|---|
bin | 1111011011100000111… |
… | …10111000110101111111 |
3 | 1212200110022212010200012 |
4 | 13231300132320311333 |
5 | 32141241014412001 |
6 | 1043320022453435 |
7 | 53206026455111 |
oct | 7556036706577 |
9 | 1780408763605 |
10 | 530168122751 |
11 | 1949300a1653 |
12 | 8690029427b |
13 | 3acc12b8897 |
14 | 1b935b133b1 |
15 | dbce3bb2bb |
hex | 7b707b8d7f |
530168122751 has 2 divisors, whose sum is σ = 530168122752. Its totient is φ = 530168122750.
The previous prime is 530168122727. The next prime is 530168122769. The reversal of 530168122751 is 157221861035.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 530168122751 - 214 = 530168106367 is a prime.
It is a super-5 number, since 5×5301681227515 (a number of 60 digits) contains 55555 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 530168122699 and 530168122708.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530168122051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265084061375 + 265084061376.
It is an arithmetic number, because the mean of its divisors is an integer number (265084061376).
Almost surely, 2530168122751 is an apocalyptic number.
530168122751 is a deficient number, since it is larger than the sum of its proper divisors (1).
530168122751 is an equidigital number, since it uses as much as digits as its factorization.
530168122751 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 100800, while the sum is 41.
Adding to 530168122751 its reverse (157221861035), we get a palindrome (687389983786).
The spelling of 530168122751 in words is "five hundred thirty billion, one hundred sixty-eight million, one hundred twenty-two thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •