Base | Representation |
---|---|
bin | 11110101111000011111… |
… | …010010000000000000000 |
3 | 21110220201222110001020201 |
4 | 132233003322100000000 |
5 | 234101103114104334 |
6 | 4254143111014544 |
7 | 305411124551200 |
oct | 36570372200000 |
9 | 7426658401221 |
10 | 2112115769344 |
11 | 74481a31a7a9 |
12 | 2a141336a454 |
13 | 1242301b09a9 |
14 | 74326a66400 |
15 | 39e1ac04c14 |
hex | 1ebc3e90000 |
2112115769344 has 153 divisors (see below), whose sum is σ = 4919930994051. Its totient is φ = 904076328960.
The previous prime is 2112115769327. The next prime is 2112115769381. The reversal of 2112115769344 is 4439675112112.
The square root of 2112115769344 is 1453312.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×21121157693442 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2112115769294 and 2112115769303.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2604334699 + ... + 2604335509.
Almost surely, 22112115769344 is an apocalyptic number.
2112115769344 is the 1453312-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2112115769344
2112115769344 is an abundant number, since it is smaller than the sum of its proper divisors (2807815224707).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112115769344 is an frugal number, since it uses more digits than its factorization.
2112115769344 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1668 (or 820 counting only the distinct ones).
The product of its digits is 362880, while the sum is 46.
The spelling of 2112115769344 in words is "two trillion, one hundred twelve billion, one hundred fifteen million, seven hundred sixty-nine thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •