Base | Representation |
---|---|
bin | 101000001010100110000… |
… | …0010001111001100110001 |
3 | 201112201212210121011010002 |
4 | 1100111030002033030301 |
5 | 1210421043002132241 |
6 | 15423554512115345 |
7 | 1106554252101332 |
oct | 120251402171461 |
9 | 21481783534102 |
10 | 5520308630321 |
11 | 1839171342561 |
12 | 751a58235b55 |
13 | 310741819a54 |
14 | 151281c70289 |
15 | 988e123689b |
hex | 5054c08f331 |
5520308630321 has 2 divisors, whose sum is σ = 5520308630322. Its totient is φ = 5520308630320.
The previous prime is 5520308630279. The next prime is 5520308630359. The reversal of 5520308630321 is 1230368030255.
It is an a-pointer prime, because the next prime (5520308630359) can be obtained adding 5520308630321 to its sum of digits (38).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3781220255296 + 1739088375025 = 1944536^2 + 1318745^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5520308630321 is a prime.
It is not a weakly prime, because it can be changed into another prime (5520308630521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2760154315160 + 2760154315161.
It is an arithmetic number, because the mean of its divisors is an integer number (2760154315161).
Almost surely, 25520308630321 is an apocalyptic number.
It is an amenable number.
5520308630321 is a deficient number, since it is larger than the sum of its proper divisors (1).
5520308630321 is an equidigital number, since it uses as much as digits as its factorization.
5520308630321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 38.
The spelling of 5520308630321 in words is "five trillion, five hundred twenty billion, three hundred eight million, six hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •