Base | Representation |
---|---|
bin | 10101100110000011001001… |
… | …01111010001000011000101 |
3 | 20020010200212010022010222122 |
4 | 22303001210233101003011 |
5 | 22211011031211134043 |
6 | 244555053531335325 |
7 | 13000545242433122 |
oct | 1263014457210305 |
9 | 206120763263878 |
10 | 47486848536773 |
11 | 14149072023938 |
12 | 53ab3295b1545 |
13 | 2065cb547a249 |
14 | ba253901d749 |
15 | 57539667e368 |
hex | 2b3064bd10c5 |
47486848536773 has 2 divisors, whose sum is σ = 47486848536774. Its totient is φ = 47486848536772.
The previous prime is 47486848536749. The next prime is 47486848536817. The reversal of 47486848536773 is 37763584868474.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34774821292324 + 12712027244449 = 5897018^2 + 3565393^2 .
It is a cyclic number.
It is not a de Polignac number, because 47486848536773 - 224 = 47486831759557 is a prime.
It is a super-2 number, since 2×474868485367732 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47486848536703) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23743424268386 + 23743424268387.
It is an arithmetic number, because the mean of its divisors is an integer number (23743424268387).
Almost surely, 247486848536773 is an apocalyptic number.
It is an amenable number.
47486848536773 is a deficient number, since it is larger than the sum of its proper divisors (1).
47486848536773 is an equidigital number, since it uses as much as digits as its factorization.
47486848536773 is an evil number, because the sum of its binary digits is even.
The product of its digits is 18207866880, while the sum is 80.
The spelling of 47486848536773 in words is "forty-seven trillion, four hundred eighty-six billion, eight hundred forty-eight million, five hundred thirty-six thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •