Base | Representation |
---|---|
bin | 1001100101100100… |
… | …00011000000110101 |
3 | 111021200220000211021 |
4 | 10302302003000311 |
5 | 41020104311022 |
6 | 2210420541141 |
7 | 241355222146 |
oct | 46262030065 |
9 | 14250800737 |
10 | 5146947637 |
11 | 2201354a37 |
12 | bb78517b1 |
13 | 64042c360 |
14 | 36b7d3acd |
15 | 201cd17c7 |
hex | 132c83035 |
5146947637 has 8 divisors (see below), whose sum is σ = 5734000440. Its totient is φ = 4587199680.
The previous prime is 5146947623. The next prime is 5146947643. The reversal of 5146947637 is 7367496415.
It can be written as a sum of positive squares in 4 ways, for example, as 1434970161 + 3711977476 = 37881^2 + 60926^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5146947637 - 219 = 5146423349 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5146947667) 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 7 ways as a sum of consecutive naturals, for example, 6825814 + ... + 6826567.
It is an arithmetic number, because the mean of its divisors is an integer number (716750055).
Almost surely, 25146947637 is an apocalyptic number.
It is an amenable number.
5146947637 is a deficient number, since it is larger than the sum of its proper divisors (587052803).
5146947637 is a wasteful number, since it uses less digits than its factorization.
5146947637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13652423.
The product of its digits is 3810240, while the sum is 52.
The square root of 5146947637 is about 71742.2304991976. The cubic root of 5146947637 is about 1726.5662606445.
The spelling of 5146947637 in words is "five billion, one hundred forty-six million, nine hundred forty-seven thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •