Base | Representation |
---|---|
bin | 111110110010000… |
… | …0101100000000000 |
3 | 12102210221222000000 |
4 | 1331210011200000 |
5 | 13303243033322 |
6 | 545012000000 |
7 | 103126622052 |
oct | 17544054000 |
9 | 5383858000 |
10 | 2106611712 |
11 | 991144617 |
12 | 4a9600000 |
13 | 27759440a |
14 | 15dacb8d2 |
15 | c4e213ac |
hex | 7d905800 |
2106611712 has 336 divisors, whose sum is σ = 6767462520. Its totient is φ = 652935168.
The previous prime is 2106611701. The next prime is 2106611783. The reversal of 2106611712 is 2171166012.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 25380823 + ... + 25380905.
Almost surely, 22106611712 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 2106611712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3383731260).
2106611712 is an abundant number, since it is smaller than the sum of its proper divisors (4660850808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2106611712 is an frugal number, since it uses more digits than its factorization.
2106611712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140 (or 105 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 2106611712 is about 45897.8399491741. The cubic root of 2106611712 is about 1281.9216967969.
Adding to 2106611712 its reverse (2171166012), we get a palindrome (4277777724).
The spelling of 2106611712 in words is "two billion, one hundred six million, six hundred eleven thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.550 sec. • engine limits •