Base | Representation |
---|---|
bin | 1001010100110010… |
… | …01101000110100101 |
3 | 110220220002012120001 |
4 | 10222121031012211 |
5 | 40223042431022 |
6 | 2144432341301 |
7 | 235026101461 |
oct | 45231150645 |
9 | 13826065501 |
10 | 5006217637 |
11 | 2139974453 |
12 | b786a4831 |
13 | 61a227975 |
14 | 356c3d4a1 |
15 | 1e4783b27 |
hex | 12a64d1a5 |
5006217637 has 4 divisors (see below), whose sum is σ = 5008241196. Its totient is φ = 5004194080.
The previous prime is 5006217589. The next prime is 5006217649. The reversal of 5006217637 is 7367126005.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3304985121 + 1701232516 = 57489^2 + 41246^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5006217637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5006217596 and 5006217605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5006217677) 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, 1008064 + ... + 1013017.
It is an arithmetic number, because the mean of its divisors is an integer number (1252060299).
Almost surely, 25006217637 is an apocalyptic number.
It is an amenable number.
5006217637 is a deficient number, since it is larger than the sum of its proper divisors (2023559).
5006217637 is a wasteful number, since it uses less digits than its factorization.
5006217637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2023558.
The product of its (nonzero) digits is 52920, while the sum is 37.
The square root of 5006217637 is about 70754.6297919790. The cubic root of 5006217637 is about 1710.6844537228.
The spelling of 5006217637 in words is "five billion, six million, two hundred seventeen thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •