Base | Representation |
---|---|
bin | 101100001101000010… |
… | …111100101100010101 |
3 | 11112111210222111000011 |
4 | 230031002330230111 |
5 | 1234201130020244 |
6 | 33445431520221 |
7 | 3300122144302 |
oct | 541502745425 |
9 | 145453874004 |
10 | 47463516949 |
11 | 19146a10872 |
12 | 9247529071 |
13 | 4625408794 |
14 | 24239040a9 |
15 | 137bd5e434 |
hex | b0d0bcb15 |
47463516949 has 2 divisors, whose sum is σ = 47463516950. Its totient is φ = 47463516948.
The previous prime is 47463516937. The next prime is 47463517007. The reversal of 47463516949 is 94961536474.
It is an a-pointer prime, because the next prime (47463517007) can be obtained adding 47463516949 to its sum of digits (58).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46652976049 + 810540900 = 215993^2 + 28470^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-47463516949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 47463516893 and 47463516902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47463516349) 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 as a sum of consecutive naturals, namely, 23731758474 + 23731758475.
It is an arithmetic number, because the mean of its divisors is an integer number (23731758475).
Almost surely, 247463516949 is an apocalyptic number.
It is an amenable number.
47463516949 is a deficient number, since it is larger than the sum of its proper divisors (1).
47463516949 is an equidigital number, since it uses as much as digits as its factorization.
47463516949 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19595520, while the sum is 58.
The spelling of 47463516949 in words is "forty-seven billion, four hundred sixty-three million, five hundred sixteen thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •