Base | Representation |
---|---|
bin | 10000001001110010010… |
… | …111000001011001111101 |
3 | 10221010011012211200010112 |
4 | 100021302113001121331 |
5 | 121141310132400221 |
6 | 2205534121115405 |
7 | 143124223010543 |
oct | 20116227013175 |
9 | 3833135750115 |
10 | 1110020200061 |
11 | 398836512673 |
12 | 15b167628b65 |
13 | 8089ca18c36 |
14 | 3ba221a7d93 |
15 | 1dd1a4ee15b |
hex | 102725c167d |
1110020200061 has 2 divisors, whose sum is σ = 1110020200062. Its totient is φ = 1110020200060.
The previous prime is 1110020200019. The next prime is 1110020200063. The reversal of 1110020200061 is 1600020200111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 822730632025 + 287289568036 = 907045^2 + 535994^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110020200061 - 214 = 1110020183677 is a prime.
Together with 1110020200063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110020200063) 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, 555010100030 + 555010100031.
It is an arithmetic number, because the mean of its divisors is an integer number (555010100031).
Almost surely, 21110020200061 is an apocalyptic number.
It is an amenable number.
1110020200061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110020200061 is an equidigital number, since it uses as much as digits as its factorization.
1110020200061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1110020200061 its reverse (1600020200111), we get a palindrome (2710040400172).
The spelling of 1110020200061 in words is "one trillion, one hundred ten billion, twenty million, two hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •