Base | Representation |
---|---|
bin | 1001101110100001… |
… | …11111000011010001 |
3 | 111110221102120000212 |
4 | 10313100333003101 |
5 | 41143333313422 |
6 | 2222105053505 |
7 | 243260453624 |
oct | 46720770321 |
9 | 14427376025 |
10 | 5222166737 |
11 | 223a860187 |
12 | 1018a87295 |
13 | 652ba75b8 |
14 | 3777b3dbb |
15 | 2086dd9e2 |
hex | 13743f0d1 |
5222166737 has 4 divisors (see below), whose sum is σ = 5223044976. Its totient is φ = 5221288500.
The previous prime is 5222166713. The next prime is 5222166749. The reversal of 5222166737 is 7376612225.
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 5222166737 - 26 = 5222166673 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5222166694 and 5222166703.
It is not an unprimeable number, because it can be changed into a prime (5222168737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 430139 + ... + 442112.
It is an arithmetic number, because the mean of its divisors is an integer number (1305761244).
Almost surely, 25222166737 is an apocalyptic number.
It is an amenable number.
5222166737 is a deficient number, since it is larger than the sum of its proper divisors (878239).
5222166737 is an equidigital number, since it uses as much as digits as its factorization.
5222166737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 878238.
The product of its digits is 211680, while the sum is 41.
The square root of 5222166737 is about 72264.5607265415. The cubic root of 5222166737 is about 1734.9364766196.
The spelling of 5222166737 in words is "five billion, two hundred twenty-two million, one hundred sixty-six thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •