Base | Representation |
---|---|
bin | 111110111100100… |
… | …1110010110110101 |
3 | 12110012101111020101 |
4 | 1331321032112311 |
5 | 13311202344023 |
6 | 545330434101 |
7 | 103225001335 |
oct | 17571162665 |
9 | 5405344211 |
10 | 2112153013 |
11 | 994289903 |
12 | 4ab432931 |
13 | 2787846a9 |
14 | 1607310c5 |
15 | c56681ad |
hex | 7de4e5b5 |
2112153013 has 4 divisors (see below), whose sum is σ = 2115633280. Its totient is φ = 2108672748.
The previous prime is 2112152989. The next prime is 2112153047. The reversal of 2112153013 is 3103512112.
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 2112153013 - 217 = 2112021941 is a prime.
It is a super-2 number, since 2×21121530132 = 8922380700649956338, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112153613) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1739223 + ... + 1740436.
It is an arithmetic number, because the mean of its divisors is an integer number (528908320).
Almost surely, 22112153013 is an apocalyptic number.
It is an amenable number.
2112153013 is a deficient number, since it is larger than the sum of its proper divisors (3480267).
2112153013 is an equidigital number, since it uses as much as digits as its factorization.
2112153013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3480266.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 2112153013 is about 45958.1659011758. The cubic root of 2112153013 is about 1283.0447157482.
Adding to 2112153013 its reverse (3103512112), we get a palindrome (5215665125).
The spelling of 2112153013 in words is "two billion, one hundred twelve million, one hundred fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •