Base | Representation |
---|---|
bin | 1111011100011011101… |
… | …00011011110001010101 |
3 | 1212201201121222211210022 |
4 | 13232031310123301111 |
5 | 32143243014410401 |
6 | 1043440524034525 |
7 | 53224154132465 |
oct | 7561564336125 |
9 | 1781647884708 |
10 | 530660310101 |
11 | 195062a02259 |
12 | 86a19092a45 |
13 | 3b06c2668bc |
14 | 1b981233ba5 |
15 | dc0c6de71b |
hex | 7b8dd1bc55 |
530660310101 has 2 divisors, whose sum is σ = 530660310102. Its totient is φ = 530660310100.
The previous prime is 530660310097. The next prime is 530660310109. The reversal of 530660310101 is 101013066035.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 404020411876 + 126639898225 = 635626^2 + 355865^2 .
It is a cyclic number.
It is not a de Polignac number, because 530660310101 - 22 = 530660310097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530660310109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265330155050 + 265330155051.
It is an arithmetic number, because the mean of its divisors is an integer number (265330155051).
Almost surely, 2530660310101 is an apocalyptic number.
It is an amenable number.
530660310101 is a deficient number, since it is larger than the sum of its proper divisors (1).
530660310101 is an equidigital number, since it uses as much as digits as its factorization.
530660310101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 530660310101 its reverse (101013066035), we get a palindrome (631673376136).
The spelling of 530660310101 in words is "five hundred thirty billion, six hundred sixty million, three hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •