Base | Representation |
---|---|
bin | 111110111100010… |
… | …1101111000001101 |
3 | 12110012010201202021 |
4 | 1331320231320031 |
5 | 13311134114411 |
6 | 545323530141 |
7 | 103223605441 |
oct | 17570557015 |
9 | 5405121667 |
10 | 2112019981 |
11 | 9941a8965 |
12 | 4ab389951 |
13 | 278738c86 |
14 | 1606d8821 |
15 | c563da71 |
hex | 7de2de0d |
2112019981 has 2 divisors, whose sum is σ = 2112019982. Its totient is φ = 2112019980.
The previous prime is 2112019979. The next prime is 2112020077. The reversal of 2112019981 is 1899102112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1811864356 + 300155625 = 42566^2 + 17325^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112019981 - 21 = 2112019979 is a prime.
It is a super-2 number, since 2×21120199812 = 8921256800286480722, which contains 22 as substring.
Together with 2112019979, 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 (2112019951) 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, 1056009990 + 1056009991.
It is an arithmetic number, because the mean of its divisors is an integer number (1056009991).
Almost surely, 22112019981 is an apocalyptic number.
It is an amenable number.
2112019981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112019981 is an equidigital number, since it uses as much as digits as its factorization.
2112019981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 34.
The square root of 2112019981 is about 45956.7185621428. The cubic root of 2112019981 is about 1283.0177780552.
The spelling of 2112019981 in words is "two billion, one hundred twelve million, nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •