Base | Representation |
---|---|
bin | 101100001100110101… |
… | …011101010011010101 |
3 | 11112111120022210220121 |
4 | 230030311131103111 |
5 | 1234144223334001 |
6 | 33445224031541 |
7 | 3300050115043 |
oct | 541465352325 |
9 | 145446283817 |
10 | 47459980501 |
11 | 19144a1588a |
12 | 92463025b1 |
13 | 462476abcb |
14 | 2423263393 |
15 | 137b8b16a1 |
hex | b0cd5d4d5 |
47459980501 has 2 divisors, whose sum is σ = 47459980502. Its totient is φ = 47459980500.
The previous prime is 47459980483. The next prime is 47459980553. The reversal of 47459980501 is 10508995474.
It is an a-pointer prime, because the next prime (47459980553) can be obtained adding 47459980501 to its sum of digits (52).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 43336414276 + 4123566225 = 208174^2 + 64215^2 .
It is a cyclic number.
It is not a de Polignac number, because 47459980501 - 29 = 47459979989 is a prime.
It is a super-2 number, since 2×474599805012 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47459980201) 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, 23729990250 + 23729990251.
It is an arithmetic number, because the mean of its divisors is an integer number (23729990251).
Almost surely, 247459980501 is an apocalyptic number.
It is an amenable number.
47459980501 is a deficient number, since it is larger than the sum of its proper divisors (1).
47459980501 is an equidigital number, since it uses as much as digits as its factorization.
47459980501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 52.
The spelling of 47459980501 in words is "forty-seven billion, four hundred fifty-nine million, nine hundred eighty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •