Base | Representation |
---|---|
bin | 110100001001111001… |
… | …0010010100011001101 |
3 | 101201002112211101111012 |
4 | 1220103302102203031 |
5 | 3313334240144411 |
6 | 123241432135005 |
7 | 11043330433121 |
oct | 1502362224315 |
9 | 351075741435 |
10 | 112001099981 |
11 | 43554779151 |
12 | 19858b37465 |
13 | a73bc6ab34 |
14 | 55c6c87581 |
15 | 2da7b2618b |
hex | 1a13c928cd |
112001099981 has 2 divisors, whose sum is σ = 112001099982. Its totient is φ = 112001099980.
The previous prime is 112001099963. The next prime is 112001100031. The reversal of 112001099981 is 189990100211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107753971081 + 4247128900 = 328259^2 + 65170^2 .
It is an emirp because it is prime and its reverse (189990100211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112001099981 is a prime.
It is a super-2 number, since 2×1120010999812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112001099941) 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, 56000549990 + 56000549991.
It is an arithmetic number, because the mean of its divisors is an integer number (56000549991).
Almost surely, 2112001099981 is an apocalyptic number.
It is an amenable number.
112001099981 is a deficient number, since it is larger than the sum of its proper divisors (1).
112001099981 is an equidigital number, since it uses as much as digits as its factorization.
112001099981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 41.
The spelling of 112001099981 in words is "one hundred twelve billion, one million, ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •