Base | Representation |
---|---|
bin | 10100100101110110001000… |
… | …00000011000101001110101 |
3 | 12221022210202011010201010102 |
4 | 22102323010000120221311 |
5 | 21413340121404412444 |
6 | 240145421113003445 |
7 | 12352301161442426 |
oct | 1222730400305165 |
9 | 187283664121112 |
10 | 45280833669749 |
11 | 13478548157277 |
12 | 50b388b6b3585 |
13 | 1c35c6c723cc2 |
14 | b278656cd64d |
15 | 537cd215984e |
hex | 292ec4018a75 |
45280833669749 has 2 divisors, whose sum is σ = 45280833669750. Its totient is φ = 45280833669748.
The previous prime is 45280833669719. The next prime is 45280833669781. The reversal of 45280833669749 is 94796633808254.
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., 44595817560100 + 685016109649 = 6678010^2 + 827657^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-45280833669749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45280833669719) 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, 22640416834874 + 22640416834875.
It is an arithmetic number, because the mean of its divisors is an integer number (22640416834875).
Almost surely, 245280833669749 is an apocalyptic number.
It is an amenable number.
45280833669749 is a deficient number, since it is larger than the sum of its proper divisors (1).
45280833669749 is an equidigital number, since it uses as much as digits as its factorization.
45280833669749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1881169920, while the sum is 74.
The spelling of 45280833669749 in words is "forty-five trillion, two hundred eighty billion, eight hundred thirty-three million, six hundred sixty-nine thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •