Base | Representation |
---|---|
bin | 10000100101101101100… |
… | …11011101111000101101 |
3 | 2000111021110111200020200 |
4 | 20102312303131320231 |
5 | 33314331133100031 |
6 | 1113504450304113 |
7 | 56116124253252 |
oct | 10226663357055 |
9 | 2014243450220 |
10 | 570002628141 |
11 | 1aa811695091 |
12 | 92578888039 |
13 | 4199bca572b |
14 | 1d834321429 |
15 | ec615b28e6 |
hex | 84b6cdde2d |
570002628141 has 6 divisors (see below), whose sum is σ = 823337129550. Its totient is φ = 380001752088.
The previous prime is 570002628113. The next prime is 570002628161. The reversal of 570002628141 is 141826200075.
570002628141 is a `hidden beast` number, since 570 + 0 + 0 + 2 + 6 + 2 + 81 + 4 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 545485644900 + 24516983241 = 738570^2 + 156579^2 .
It is not a de Polignac number, because 570002628141 - 217 = 570002497069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 570002628096 and 570002628105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (570002628161) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 31666812666 + ... + 31666812683.
It is an arithmetic number, because the mean of its divisors is an integer number (137222854925).
Almost surely, 2570002628141 is an apocalyptic number.
It is an amenable number.
570002628141 is a deficient number, since it is larger than the sum of its proper divisors (253334501409).
570002628141 is a wasteful number, since it uses less digits than its factorization.
570002628141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63333625355 (or 63333625352 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The spelling of 570002628141 in words is "five hundred seventy billion, two million, six hundred twenty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •