Base | Representation |
---|---|
bin | 111110111101011… |
… | …1010101010100001 |
3 | 12110020020000210001 |
4 | 1331322322222201 |
5 | 13311311043031 |
6 | 545344140001 |
7 | 103231526611 |
oct | 17572725241 |
9 | 5406200701 |
10 | 2112596641 |
11 | 994562141 |
12 | 4ab607601 |
13 | 2788ab5ac |
14 | 160808a41 |
15 | c5704861 |
hex | 7debaaa1 |
2112596641 has 4 divisors (see below), whose sum is σ = 2133107392. Its totient is φ = 2092085892.
The previous prime is 2112596639. The next prime is 2112596671. The reversal of 2112596641 is 1466952112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2112596641 - 21 = 2112596639 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2112596641.
It is not an unprimeable number, because it can be changed into a prime (2112596671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10255221 + ... + 10255426.
It is an arithmetic number, because the mean of its divisors is an integer number (533276848).
Almost surely, 22112596641 is an apocalyptic number.
It is an amenable number.
2112596641 is a deficient number, since it is larger than the sum of its proper divisors (20510751).
2112596641 is a wasteful number, since it uses less digits than its factorization.
2112596641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20510750.
The product of its digits is 25920, while the sum is 37.
The square root of 2112596641 is about 45962.9920805859. The cubic root of 2112596641 is about 1283.1345379521.
The spelling of 2112596641 in words is "two billion, one hundred twelve million, five hundred ninety-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •