Base | Representation |
---|---|
bin | 11101101110000010111… |
… | …01110111000101101001 |
3 | 10121121202220200012122202 |
4 | 32313001131313011221 |
5 | 113212310142022112 |
6 | 2101040010225545 |
7 | 133530060651134 |
oct | 16670135670551 |
9 | 3547686605582 |
10 | 1021153079657 |
11 | 364083323807 |
12 | 145aa61252b5 |
13 | 753a981a219 |
14 | 375d192721b |
15 | 1b8688506c2 |
hex | edc1777169 |
1021153079657 has 2 divisors, whose sum is σ = 1021153079658. Its totient is φ = 1021153079656.
The previous prime is 1021153079641. The next prime is 1021153079659. The reversal of 1021153079657 is 7569703511201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 928286002576 + 92867077081 = 963476^2 + 304741^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021153079657 - 24 = 1021153079641 is a prime.
It is a super-2 number, since 2×10211530796572 (a number of 25 digits) contains 22 as substring.
Together with 1021153079659, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1021153079659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510576539828 + 510576539829.
It is an arithmetic number, because the mean of its divisors is an integer number (510576539829).
Almost surely, 21021153079657 is an apocalyptic number.
It is an amenable number.
1021153079657 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021153079657 is an equidigital number, since it uses as much as digits as its factorization.
1021153079657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 396900, while the sum is 47.
The spelling of 1021153079657 in words is "one trillion, twenty-one billion, one hundred fifty-three million, seventy-nine thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •