Base | Representation |
---|---|
bin | 10100111101100001000… |
… | …100100010111101000101 |
3 | 12002201000220221001111202 |
4 | 110331201010202331011 |
5 | 142100011303011421 |
6 | 3021421420312245 |
7 | 206032340205161 |
oct | 24754104427505 |
9 | 5081026831452 |
10 | 1440442625861 |
11 | 505985345728 |
12 | 1b32013a2685 |
13 | a5aaa5a3815 |
14 | 4da098b5ca1 |
15 | 2770892a10b |
hex | 14f61122f45 |
1440442625861 has 2 divisors, whose sum is σ = 1440442625862. Its totient is φ = 1440442625860.
The previous prime is 1440442625837. The next prime is 1440442625863. The reversal of 1440442625861 is 1685262440441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1439196112225 + 1246513636 = 1199665^2 + 35306^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1440442625861 is a prime.
Together with 1440442625863, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1440442625863) 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, 720221312930 + 720221312931.
It is an arithmetic number, because the mean of its divisors is an integer number (720221312931).
Almost surely, 21440442625861 is an apocalyptic number.
It is an amenable number.
1440442625861 is a deficient number, since it is larger than the sum of its proper divisors (1).
1440442625861 is an equidigital number, since it uses as much as digits as its factorization.
1440442625861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1474560, while the sum is 47.
The spelling of 1440442625861 in words is "one trillion, four hundred forty billion, four hundred forty-two million, six hundred twenty-five thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •