Base | Representation |
---|---|
bin | 10000001011101001101… |
… | …100000101111000000101 |
3 | 10221022022201222102100121 |
4 | 100023221230011320011 |
5 | 121204410141241401 |
6 | 2210504515141541 |
7 | 143224642562413 |
oct | 20135154057005 |
9 | 3838281872317 |
10 | 1112022212101 |
11 | 399673603979 |
12 | 15b625ba48b1 |
13 | 80b2b719048 |
14 | 3bb720282b3 |
15 | 1ddd615cca1 |
hex | 102e9b05e05 |
1112022212101 has 2 divisors, whose sum is σ = 1112022212102. Its totient is φ = 1112022212100.
The previous prime is 1112022212099. The next prime is 1112022212123. The reversal of 1112022212101 is 1012122202111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 952330063876 + 159692148225 = 975874^2 + 399615^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112022212101 - 21 = 1112022212099 is a prime.
Together with 1112022212099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112022212141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556011106050 + 556011106051.
It is an arithmetic number, because the mean of its divisors is an integer number (556011106051).
Almost surely, 21112022212101 is an apocalyptic number.
It is an amenable number.
1112022212101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112022212101 is an equidigital number, since it uses as much as digits as its factorization.
1112022212101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1112022212101 its reverse (1012122202111), we get a palindrome (2124144414212).
The spelling of 1112022212101 in words is "one trillion, one hundred twelve billion, twenty-two million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •