Base | Representation |
---|---|
bin | 1000001011001000000… |
… | …0000101010010111001 |
3 | 111102110111000100120022 |
4 | 2002302000011102321 |
5 | 4300042340211414 |
6 | 144302133540225 |
7 | 13100604344111 |
oct | 2026200052271 |
9 | 442414010508 |
10 | 140425319609 |
11 | 54610483053 |
12 | 232701a4675 |
13 | 1031ba2a0c3 |
14 | 6b21d04041 |
15 | 39bd23718e |
hex | 20b20054b9 |
140425319609 has 2 divisors, whose sum is σ = 140425319610. Its totient is φ = 140425319608.
The previous prime is 140425319563. The next prime is 140425319611. The reversal of 140425319609 is 906913524041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85762879609 + 54662440000 = 292853^2 + 233800^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140425319609 is a prime.
Together with 140425319611, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140425319609.
It is not a weakly prime, because it can be changed into another prime (140425319689) 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, 70212659804 + 70212659805.
It is an arithmetic number, because the mean of its divisors is an integer number (70212659805).
Almost surely, 2140425319609 is an apocalyptic number.
It is an amenable number.
140425319609 is a deficient number, since it is larger than the sum of its proper divisors (1).
140425319609 is an equidigital number, since it uses as much as digits as its factorization.
140425319609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 44.
The spelling of 140425319609 in words is "one hundred forty billion, four hundred twenty-five million, three hundred nineteen thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •