Base | Representation |
---|---|
bin | 11101101110110000110… |
… | …00110110011111001001 |
3 | 10121122202201022000121211 |
4 | 32313120120312133021 |
5 | 113214102114024231 |
6 | 2101142104533121 |
7 | 133542440456341 |
oct | 16673030663711 |
9 | 3548681260554 |
10 | 1021537642441 |
11 | 364260405498 |
12 | 145b92a811a1 |
13 | 7543b3b5174 |
14 | 3762aa2dd21 |
15 | 1b88c4b4eb1 |
hex | edd86367c9 |
1021537642441 has 2 divisors, whose sum is σ = 1021537642442. Its totient is φ = 1021537642440.
The previous prime is 1021537642439. The next prime is 1021537642451. The reversal of 1021537642441 is 1442467351201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 606023325625 + 415514316816 = 778475^2 + 644604^2 .
It is a cyclic number.
It is not a de Polignac number, because 1021537642441 - 21 = 1021537642439 is a prime.
Together with 1021537642439, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1021537642394 and 1021537642403.
It is not a weakly prime, because it can be changed into another prime (1021537642421) 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, 510768821220 + 510768821221.
It is an arithmetic number, because the mean of its divisors is an integer number (510768821221).
Almost surely, 21021537642441 is an apocalyptic number.
It is an amenable number.
1021537642441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021537642441 is an equidigital number, since it uses as much as digits as its factorization.
1021537642441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 161280, while the sum is 40.
The spelling of 1021537642441 in words is "one trillion, twenty-one billion, five hundred thirty-seven million, six hundred forty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •