Base | Representation |
---|---|
bin | 10001110101010011001… |
… | …001011110100000100101 |
3 | 11100011010110110021201122 |
4 | 101311103021132200211 |
5 | 130034220413010144 |
6 | 2334545135103325 |
7 | 154352025564041 |
oct | 21652311364045 |
9 | 4304113407648 |
10 | 1225460672549 |
11 | 432795669233 |
12 | 179604371b45 |
13 | 8b7393b6919 |
14 | 43453b4b021 |
15 | 21d250587ee |
hex | 11d5325e825 |
1225460672549 has 2 divisors, whose sum is σ = 1225460672550. Its totient is φ = 1225460672548.
The previous prime is 1225460672539. The next prime is 1225460672563. The reversal of 1225460672549 is 9452760645221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1222771524100 + 2689148449 = 1105790^2 + 51857^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1225460672549 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1225460672549.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1225460672539) 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, 612730336274 + 612730336275.
It is an arithmetic number, because the mean of its divisors is an integer number (612730336275).
Almost surely, 21225460672549 is an apocalyptic number.
It is an amenable number.
1225460672549 is a deficient number, since it is larger than the sum of its proper divisors (1).
1225460672549 is an equidigital number, since it uses as much as digits as its factorization.
1225460672549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7257600, while the sum is 53.
The spelling of 1225460672549 in words is "one trillion, two hundred twenty-five billion, four hundred sixty million, six hundred seventy-two thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •