Base | Representation |
---|---|
bin | 10110011101010001010110… |
… | …10101100100110110101001 |
3 | 20110212002102001200111012022 |
4 | 23032220223111210312221 |
5 | 22433102431311430143 |
6 | 253010452154354225 |
7 | 13254616011600641 |
oct | 1316505325446651 |
9 | 213762361614168 |
10 | 49384261045673 |
11 | 1480a824a08224 |
12 | 565700112b975 |
13 | 2172bba11b758 |
14 | c2a2d4d45521 |
15 | 5a98e81b3268 |
hex | 2cea2b564da9 |
49384261045673 has 2 divisors, whose sum is σ = 49384261045674. Its totient is φ = 49384261045672.
The previous prime is 49384261045619. The next prime is 49384261045759. The reversal of 49384261045673 is 37654016248394.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 36551552540944 + 12832708504729 = 6045788^2 + 3582277^2 .
It is a cyclic number.
It is not a de Polignac number, because 49384261045673 - 228 = 49383992610217 is a prime.
It is not a weakly prime, because it can be changed into another prime (49384261041673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24692130522836 + 24692130522837.
It is an arithmetic number, because the mean of its divisors is an integer number (24692130522837).
It is a 2-persistent number, because it is pandigital, and so is 2⋅49384261045673 = 98768522091346, but 3⋅49384261045673 = 148152783137019 is not.
Almost surely, 249384261045673 is an apocalyptic number.
It is an amenable number.
49384261045673 is a deficient number, since it is larger than the sum of its proper divisors (1).
49384261045673 is an equidigital number, since it uses as much as digits as its factorization.
49384261045673 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 104509440, while the sum is 62.
The spelling of 49384261045673 in words is "forty-nine trillion, three hundred eighty-four billion, two hundred sixty-one million, forty-five thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •