Base | Representation |
---|---|
bin | 11110101110010100000… |
… | …000000010101011000110 |
3 | 21110211122221222101021110 |
4 | 132232110000002223012 |
5 | 234042431331400004 |
6 | 4253531235025450 |
7 | 305352164506530 |
oct | 36562400025306 |
9 | 7424587871243 |
10 | 2111311981254 |
11 | 744447631923 |
12 | 2a122a13b286 |
13 | 124132802838 |
14 | 7428bdd2850 |
15 | 39dc0380589 |
hex | 1eb94002ac6 |
2111311981254 has 128 divisors (see below), whose sum is σ = 5156495769600. Its totient is φ = 563270108544.
The previous prime is 2111311981253. The next prime is 2111311981271. The reversal of 2111311981254 is 4521891131112.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2111311981253) 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 63 ways as a sum of consecutive naturals, for example, 10084789 + ... + 10292015.
It is an arithmetic number, because the mean of its divisors is an integer number (40285123200).
Almost surely, 22111311981254 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2111311981254, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2578247884800).
2111311981254 is an abundant number, since it is smaller than the sum of its proper divisors (3045183788346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111311981254 is a wasteful number, since it uses less digits than its factorization.
2111311981254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207514.
The product of its digits is 17280, while the sum is 39.
The spelling of 2111311981254 in words is "two trillion, one hundred eleven billion, three hundred eleven million, nine hundred eighty-one thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •