Base | Representation |
---|---|
bin | 10000100111011010010… |
… | …00100001101100010101 |
3 | 2000120121222122011211221 |
4 | 20103231020201230111 |
5 | 33323213003242141 |
6 | 1114135130530341 |
7 | 56150532636313 |
oct | 10235510415425 |
9 | 2016558564757 |
10 | 570914118421 |
11 | 20013a155239 |
12 | 92791b969b1 |
13 | 41ab5a930aa |
14 | 1d8bd3cd0b3 |
15 | ecb660dbd1 |
hex | 84ed221b15 |
570914118421 has 2 divisors, whose sum is σ = 570914118422. Its totient is φ = 570914118420.
The previous prime is 570914118419. The next prime is 570914118461. The reversal of 570914118421 is 124811419075.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 515467997521 + 55446120900 = 717961^2 + 235470^2 .
It is a cyclic number.
It is not a de Polignac number, because 570914118421 - 21 = 570914118419 is a prime.
It is a super-2 number, since 2×5709141184212 (a number of 24 digits) contains 22 as substring.
Together with 570914118419, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (570914118461) 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, 285457059210 + 285457059211.
It is an arithmetic number, because the mean of its divisors is an integer number (285457059211).
Almost surely, 2570914118421 is an apocalyptic number.
It is an amenable number.
570914118421 is a deficient number, since it is larger than the sum of its proper divisors (1).
570914118421 is an equidigital number, since it uses as much as digits as its factorization.
570914118421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80640, while the sum is 43.
The spelling of 570914118421 in words is "five hundred seventy billion, nine hundred fourteen million, one hundred eighteen thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •