Base | Representation |
---|---|
bin | 11101101101110010000… |
… | …00010010110000101101 |
3 | 10121121102000112110012202 |
4 | 32312321000102300231 |
5 | 113212012321022312 |
6 | 2101013535311245 |
7 | 133523415151205 |
oct | 16667100226055 |
9 | 3547360473182 |
10 | 1021011110957 |
11 | 364010177602 |
12 | 145a6667b525 |
13 | 753862a0a86 |
14 | 375bab2d405 |
15 | 1b85b15a9c2 |
hex | edb9012c2d |
1021011110957 has 2 divisors, whose sum is σ = 1021011110958. Its totient is φ = 1021011110956.
The previous prime is 1021011110927. The next prime is 1021011110969. The reversal of 1021011110957 is 7590111101201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1012973809156 + 8037301801 = 1006466^2 + 89651^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021011110957 - 210 = 1021011109933 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021011110927) 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, 510505555478 + 510505555479.
It is an arithmetic number, because the mean of its divisors is an integer number (510505555479).
Almost surely, 21021011110957 is an apocalyptic number.
It is an amenable number.
1021011110957 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021011110957 is an equidigital number, since it uses as much as digits as its factorization.
1021011110957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 29.
The spelling of 1021011110957 in words is "one trillion, twenty-one billion, eleven million, one hundred ten thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •