Base | Representation |
---|---|
bin | 11110101111000111001… |
… | …111100011011110100000 |
3 | 21110220212212122220012021 |
4 | 132233013033203132200 |
5 | 234101211422421132 |
6 | 4254152425311224 |
7 | 305412404050000 |
oct | 36570717433640 |
9 | 7426785586167 |
10 | 2112171685792 |
11 | 744848941643 |
12 | 2a142a035514 |
13 | 12423b95b04c |
14 | 74330260000 |
15 | 39e20a9c997 |
hex | 1ebc73e37a0 |
2112171685792 has 120 divisors (see below), whose sum is σ = 4895630655300. Its totient is φ = 896908142592.
The previous prime is 2112171685783. The next prime is 2112171685823. The reversal of 2112171685792 is 2975861712112.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1791539418256 + 320632267536 = 1338484^2 + 566244^2 .
It is a super-2 number, since 2×21121716857922 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 8248584 + ... + 8500792.
Almost surely, 22112171685792 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2112171685792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2447815327650).
2112171685792 is an abundant number, since it is smaller than the sum of its proper divisors (2783458969508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112171685792 is an equidigital number, since it uses as much as digits as its factorization.
2112171685792 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 252356 (or 252327 counting only the distinct ones).
The product of its digits is 846720, while the sum is 52.
The spelling of 2112171685792 in words is "two trillion, one hundred twelve billion, one hundred seventy-one million, six hundred eighty-five thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •