Base | Representation |
---|---|
bin | 11101101100010011110… |
… | …10010011010001110111 |
3 | 10121112100221211012220201 |
4 | 32312021322103101313 |
5 | 113203403034323223 |
6 | 2100403312541331 |
7 | 133465012340032 |
oct | 16661172232167 |
9 | 3545327735821 |
10 | 1020221011063 |
11 | 363745188891 |
12 | 145885b51847 |
13 | 7528b6a6147 |
14 | 37543c20019 |
15 | 1b811adbead |
hex | ed89e93477 |
1020221011063 has 2 divisors, whose sum is σ = 1020221011064. Its totient is φ = 1020221011062.
The previous prime is 1020221011039. The next prime is 1020221011163. The reversal of 1020221011063 is 3601101220201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1020221011063 - 221 = 1020218913911 is a prime.
It is a super-2 number, since 2×10202210110632 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1020221011063.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020221011163) 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, 510110505531 + 510110505532.
It is an arithmetic number, because the mean of its divisors is an integer number (510110505532).
Almost surely, 21020221011063 is an apocalyptic number.
1020221011063 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020221011063 is an equidigital number, since it uses as much as digits as its factorization.
1020221011063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1020221011063 its reverse (3601101220201), we get a palindrome (4621322231264).
The spelling of 1020221011063 in words is "one trillion, twenty billion, two hundred twenty-one million, eleven thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •