Base | Representation |
---|---|
bin | 101010010110011001001… |
… | …1110001100100000001101 |
3 | 202121102210120022000001111 |
4 | 1110230302132030200031 |
5 | 1230330420012244123 |
6 | 20213525143412021 |
7 | 1140343045054306 |
oct | 124546236144015 |
9 | 22542716260044 |
10 | 5820527462413 |
11 | 1944521014624 |
12 | 7a0082a54011 |
13 | 332b47a975b1 |
14 | 161a020977ad |
15 | a1612c1e90d |
hex | 54b3278c80d |
5820527462413 has 2 divisors, whose sum is σ = 5820527462414. Its totient is φ = 5820527462412.
The previous prime is 5820527462377. The next prime is 5820527462423. The reversal of 5820527462413 is 3142647250285.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5777494864164 + 43032598249 = 2403642^2 + 207443^2 .
It is a cyclic number.
It is not a de Polignac number, because 5820527462413 - 217 = 5820527331341 is a prime.
It is a super-3 number, since 3×58205274624133 (a number of 39 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5820527462423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2910263731206 + 2910263731207.
It is an arithmetic number, because the mean of its divisors is an integer number (2910263731207).
Almost surely, 25820527462413 is an apocalyptic number.
It is an amenable number.
5820527462413 is a deficient number, since it is larger than the sum of its proper divisors (1).
5820527462413 is an equidigital number, since it uses as much as digits as its factorization.
5820527462413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3225600, while the sum is 49.
The spelling of 5820527462413 in words is "five trillion, eight hundred twenty billion, five hundred twenty-seven million, four hundred sixty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •