Base | Representation |
---|---|
bin | 1000000100000101… |
… | …0110101111000011 |
3 | 12120212002220002211 |
4 | 2001001112233003 |
5 | 13413120204011 |
6 | 554443122551 |
7 | 104432635126 |
oct | 20101265703 |
9 | 5525086084 |
10 | 2164616131 |
11 | a10962157 |
12 | 504b13457 |
13 | 2865c2c62 |
14 | 1676aa3bd |
15 | ca07cb21 |
hex | 81056bc3 |
2164616131 has 4 divisors (see below), whose sum is σ = 2201304600. Its totient is φ = 2127927664.
The previous prime is 2164616123. The next prime is 2164616141. The reversal of 2164616131 is 1316164612.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2164616131 - 23 = 2164616123 is a prime.
It is a super-2 number, since 2×21646161312 = 9371125989170818322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2164616093 and 2164616102.
It is not an unprimeable number, because it can be changed into a prime (2164616141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18344146 + ... + 18344263.
It is an arithmetic number, because the mean of its divisors is an integer number (550326150).
Almost surely, 22164616131 is an apocalyptic number.
2164616131 is a deficient number, since it is larger than the sum of its proper divisors (36688469).
2164616131 is an equidigital number, since it uses as much as digits as its factorization.
2164616131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36688468.
The product of its digits is 5184, while the sum is 31.
The square root of 2164616131 is about 46525.4353123106. The cubic root of 2164616131 is about 1293.5810062943.
The spelling of 2164616131 in words is "two billion, one hundred sixty-four million, six hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •