Base | Representation |
---|---|
bin | 101100101010110001… |
… | …000010101101101001 |
3 | 11120210120020010112221 |
4 | 230222301002231221 |
5 | 1241211301430442 |
6 | 34011123034041 |
7 | 3315355313326 |
oct | 545261025551 |
9 | 146716203487 |
10 | 47962139497 |
11 | 19382417318 |
12 | 936650b921 |
13 | 46a47ca8cc |
14 | 246dc1bb4d |
15 | 13aaa04467 |
hex | b2ac42b69 |
47962139497 has 2 divisors, whose sum is σ = 47962139498. Its totient is φ = 47962139496.
The previous prime is 47962139483. The next prime is 47962139503. The reversal of 47962139497 is 79493126974.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29523486976 + 18438652521 = 171824^2 + 135789^2 .
It is a cyclic number.
It is not a de Polignac number, because 47962139497 - 215 = 47962106729 is a prime.
It is not a weakly prime, because it can be changed into another prime (47962139447) 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, 23981069748 + 23981069749.
It is an arithmetic number, because the mean of its divisors is an integer number (23981069749).
Almost surely, 247962139497 is an apocalyptic number.
It is an amenable number.
47962139497 is a deficient number, since it is larger than the sum of its proper divisors (1).
47962139497 is an equidigital number, since it uses as much as digits as its factorization.
47962139497 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20575296, while the sum is 61.
The spelling of 47962139497 in words is "forty-seven billion, nine hundred sixty-two million, one hundred thirty-nine thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •