Base | Representation |
---|---|
bin | 1001011001101000… |
… | …01100011010101111 |
3 | 111000201112101202212 |
4 | 10230310030122233 |
5 | 40313443102101 |
6 | 2152443241035 |
7 | 236031331043 |
oct | 45464143257 |
9 | 14021471685 |
10 | 5046847151 |
11 | 215a8a4a65 |
12 | b8a21917b |
13 | 625781bb8 |
14 | 35c3b8023 |
15 | 1e810c1bb |
hex | 12cd0c6af |
5046847151 has 16 divisors (see below), whose sum is σ = 5440309248. Its totient is φ = 4668127200.
The previous prime is 5046847147. The next prime is 5046847199. The reversal of 5046847151 is 1517486405.
It is a cyclic number.
It is not a de Polignac number, because 5046847151 - 22 = 5046847147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5046847099 and 5046847108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5046847651) 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 15 ways as a sum of consecutive naturals, for example, 1581980 + ... + 1585166.
It is an arithmetic number, because the mean of its divisors is an integer number (340019328).
Almost surely, 25046847151 is an apocalyptic number.
5046847151 is a deficient number, since it is larger than the sum of its proper divisors (393462097).
5046847151 is a wasteful number, since it uses less digits than its factorization.
5046847151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5462.
The product of its (nonzero) digits is 134400, while the sum is 41.
The square root of 5046847151 is about 71041.1651861088. The cubic root of 5046847151 is about 1715.2998539015.
The spelling of 5046847151 in words is "five billion, forty-six million, eight hundred forty-seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •