Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …011101001010111011101 |
3 | 10220011021222100202100012 |
4 | 100000131023221113131 |
5 | 121010300303020221 |
6 | 2201200015413005 |
7 | 142321025045402 |
oct | 20003513512735 |
9 | 3804258322305 |
10 | 1100001220061 |
11 | 394565014707 |
12 | 159230224165 |
13 | 7c9641146c3 |
14 | 3b3517042a9 |
15 | 1d930b4265b |
hex | 1001d2e95dd |
1100001220061 has 2 divisors, whose sum is σ = 1100001220062. Its totient is φ = 1100001220060.
The previous prime is 1100001220027. The next prime is 1100001220063. The reversal of 1100001220061 is 1600221000011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1062899140900 + 37102079161 = 1030970^2 + 192619^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100001220061 - 26 = 1100001219997 is a prime.
Together with 1100001220063, 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 (1100001220063) 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, 550000610030 + 550000610031.
It is an arithmetic number, because the mean of its divisors is an integer number (550000610031).
Almost surely, 21100001220061 is an apocalyptic number.
It is an amenable number.
1100001220061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100001220061 is an equidigital number, since it uses as much as digits as its factorization.
1100001220061 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 1100001220061 its reverse (1600221000011), we get a palindrome (2700222220072).
The spelling of 1100001220061 in words is "one trillion, one hundred billion, one million, two hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •