Base | Representation |
---|---|
bin | 101011110010011100… |
… | …001011001001110101 |
3 | 11111100201001102201212 |
4 | 223302130023021311 |
5 | 1232242342114244 |
6 | 33333244331205 |
7 | 3253062065225 |
oct | 536234131165 |
9 | 144321042655 |
10 | 47017144949 |
11 | 18a37a52995 |
12 | 9141b43b05 |
13 | 4583aac238 |
14 | 23c050c085 |
15 | 1352a8ad9e |
hex | af270b275 |
47017144949 has 2 divisors, whose sum is σ = 47017144950. Its totient is φ = 47017144948.
The previous prime is 47017144931. The next prime is 47017144957. The reversal of 47017144949 is 94944171074.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31379642449 + 15637502500 = 177143^2 + 125050^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-47017144949 is a prime.
It is a super-2 number, since 2×470171449492 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 47017144897 and 47017144906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47017140949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23508572474 + 23508572475.
It is an arithmetic number, because the mean of its divisors is an integer number (23508572475).
Almost surely, 247017144949 is an apocalyptic number.
It is an amenable number.
47017144949 is a deficient number, since it is larger than the sum of its proper divisors (1).
47017144949 is an equidigital number, since it uses as much as digits as its factorization.
47017144949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1016064, while the sum is 50.
The spelling of 47017144949 in words is "forty-seven billion, seventeen million, one hundred forty-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •