Base | Representation |
---|---|
bin | 111110111101010… |
… | …0101110000000101 |
3 | 12110020001200021110 |
4 | 1331322211300011 |
5 | 13311300322411 |
6 | 545342235233 |
7 | 103231022100 |
oct | 17572456005 |
9 | 5406050243 |
10 | 2112510981 |
11 | 994503849 |
12 | 4ab585b19 |
13 | 27887b5c9 |
14 | 1607c5737 |
15 | c56d92a6 |
hex | 7dea5c05 |
2112510981 has 12 divisors (see below), whose sum is σ = 3276547872. Its totient is φ = 1207149048.
The previous prime is 2112510979. The next prime is 2112511007. The reversal of 2112510981 is 1890152112.
It is not a de Polignac number, because 2112510981 - 21 = 2112510979 is a prime.
It is a super-2 number, since 2×21125109812 = 8925405289691164722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112510971) 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 in 11 ways as a sum of consecutive naturals, for example, 7185265 + ... + 7185558.
It is an arithmetic number, because the mean of its divisors is an integer number (273045656).
Almost surely, 22112510981 is an apocalyptic number.
2112510981 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2112510981 is a deficient number, since it is larger than the sum of its proper divisors (1164036891).
2112510981 is a wasteful number, since it uses less digits than its factorization.
2112510981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14370840 (or 14370833 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 30.
The square root of 2112510981 is about 45962.0602345021. The cubic root of 2112510981 is about 1283.1171951888.
The spelling of 2112510981 in words is "two billion, one hundred twelve million, five hundred ten thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •