Base | Representation |
---|---|
bin | 1000000100101101… |
… | …0001000010100001 |
3 | 12121000222220001010 |
4 | 2001023101002201 |
5 | 13414301323431 |
6 | 555014531133 |
7 | 104464005603 |
oct | 20113210241 |
9 | 5530886033 |
10 | 2167214241 |
11 | a12377155 |
12 | 505966aa9 |
13 | 286cc26ba |
14 | 167b85173 |
15 | ca3e2846 |
hex | 812d10a1 |
2167214241 has 4 divisors (see below), whose sum is σ = 2889618992. Its totient is φ = 1444809492.
The previous prime is 2167214239. The next prime is 2167214243. The reversal of 2167214241 is 1424127612.
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 an interprime number because it is at equal distance from previous prime (2167214239) and next prime (2167214243).
It is not a de Polignac number, because 2167214241 - 21 = 2167214239 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2167214199 and 2167214208.
It is not an unprimeable number, because it can be changed into a prime (2167214243) 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, 361202371 + ... + 361202376.
It is an arithmetic number, because the mean of its divisors is an integer number (722404748).
Almost surely, 22167214241 is an apocalyptic number.
It is an amenable number.
2167214241 is a deficient number, since it is larger than the sum of its proper divisors (722404751).
2167214241 is an equidigital number, since it uses as much as digits as its factorization.
2167214241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 722404750.
The product of its digits is 5376, while the sum is 30.
The square root of 2167214241 is about 46553.3483328536. The cubic root of 2167214241 is about 1294.0983454435.
The spelling of 2167214241 in words is "two billion, one hundred sixty-seven million, two hundred fourteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •