Base | Representation |
---|---|
bin | 11010000111010010111101… |
… | …11010101101111101111111 |
3 | 21112022210202020212212220122 |
4 | 31003221132322231331333 |
5 | 30011324011112322323 |
6 | 322044453201205155 |
7 | 15044561411264216 |
oct | 1503513672557577 |
9 | 245283666785818 |
10 | 57425305198463 |
11 | 1732aa31789994 |
12 | 65354aa6307bb |
13 | 260724c1c1147 |
14 | 102758471407d |
15 | 698b6d613ec8 |
hex | 343a5eeadf7f |
57425305198463 has 2 divisors, whose sum is σ = 57425305198464. Its totient is φ = 57425305198462.
The previous prime is 57425305198411. The next prime is 57425305198507. The reversal of 57425305198463 is 36489150352475.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 57425305198463 - 216 = 57425305132927 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 57425305198396 and 57425305198405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (57425305198403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28712652599231 + 28712652599232.
It is an arithmetic number, because the mean of its divisors is an integer number (28712652599232).
It is a 1-persistent number, because it is pandigital, but 2⋅57425305198463 = 114850610396926 is not.
Almost surely, 257425305198463 is an apocalyptic number.
57425305198463 is a deficient number, since it is larger than the sum of its proper divisors (1).
57425305198463 is an equidigital number, since it uses as much as digits as its factorization.
57425305198463 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864000, while the sum is 62.
The spelling of 57425305198463 in words is "fifty-seven trillion, four hundred twenty-five billion, three hundred five million, one hundred ninety-eight thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •