Base | Representation |
---|---|
bin | 100001001001001… |
… | …0101010001011101 |
3 | 2212111121122010021 |
4 | 1002102111101131 |
5 | 4234144230411 |
6 | 302204112141 |
7 | 36362465554 |
oct | 10222252135 |
9 | 2774548107 |
10 | 1112101981 |
11 | 520830751 |
12 | 270535651 |
13 | 14952a213 |
14 | a79acd9b |
15 | 67976a71 |
hex | 4249545d |
1112101981 has 2 divisors, whose sum is σ = 1112101982. Its totient is φ = 1112101980.
The previous prime is 1112101951. The next prime is 1112101997. The reversal of 1112101981 is 1891012111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 975562756 + 136539225 = 31234^2 + 11685^2 .
It is an emirp because it is prime and its reverse (1891012111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1112101981 - 215 = 1112069213 is a prime.
It is a super-2 number, since 2×11121019812 = 2473541632288248722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112101951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556050990 + 556050991.
It is an arithmetic number, because the mean of its divisors is an integer number (556050991).
Almost surely, 21112101981 is an apocalyptic number.
It is an amenable number.
1112101981 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112101981 is an equidigital number, since it uses as much as digits as its factorization.
1112101981 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 25.
The square root of 1112101981 is about 33348.1930694903. The cubic root of 1112101981 is about 1036.0519634868.
The spelling of 1112101981 in words is "one billion, one hundred twelve million, one hundred one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •