Base | Representation |
---|---|
bin | 100101000100110… |
… | …1000110100001101 |
3 | 10012200212210200122 |
4 | 1022021220310031 |
5 | 10021433243321 |
6 | 323240034325 |
7 | 42554112056 |
oct | 11211506415 |
9 | 3180783618 |
10 | 1244040461 |
11 | 589257014 |
12 | 2a87629a5 |
13 | 16a974121 |
14 | bb31572d |
15 | 743398ab |
hex | 4a268d0d |
1244040461 has 2 divisors, whose sum is σ = 1244040462. Its totient is φ = 1244040460.
The previous prime is 1244040431. The next prime is 1244040563. The reversal of 1244040461 is 1640404421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 924524836 + 319515625 = 30406^2 + 17875^2 .
It is a cyclic number.
It is not a de Polignac number, because 1244040461 - 26 = 1244040397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1244040461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1244040431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 622020230 + 622020231.
It is an arithmetic number, because the mean of its divisors is an integer number (622020231).
Almost surely, 21244040461 is an apocalyptic number.
It is an amenable number.
1244040461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1244040461 is an equidigital number, since it uses as much as digits as its factorization.
1244040461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 26.
The square root of 1244040461 is about 35270.9577556380. The cubic root of 1244040461 is about 1075.5026921701.
Adding to 1244040461 its reverse (1640404421), we get a palindrome (2884444882).
The spelling of 1244040461 in words is "one billion, two hundred forty-four million, forty thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •