Base | Representation |
---|---|
bin | 11111110110110001001100… |
… | …001000001010011110000101 |
3 | 200101001201121122122202222001 |
4 | 133312301030020022132011 |
5 | 121330422132230411343 |
6 | 1213550251432505301 |
7 | 41340054453203533 |
oct | 3766611410123605 |
9 | 611051548582861 |
10 | 140103110403973 |
11 | 40706439384942 |
12 | 13868b0824b231 |
13 | 602388874b862 |
14 | 2685053493153 |
15 | 112e60b82744d |
hex | 7f6c4c20a785 |
140103110403973 has 2 divisors, whose sum is σ = 140103110403974. Its totient is φ = 140103110403972.
The previous prime is 140103110403967. The next prime is 140103110404003. The reversal of 140103110403973 is 379304011301041.
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., 130747721643009 + 9355388760964 = 11434497^2 + 3058658^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140103110403973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140103110443973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70051555201986 + 70051555201987.
It is an arithmetic number, because the mean of its divisors is an integer number (70051555201987).
Almost surely, 2140103110403973 is an apocalyptic number.
It is an amenable number.
140103110403973 is a deficient number, since it is larger than the sum of its proper divisors (1).
140103110403973 is an equidigital number, since it uses as much as digits as its factorization.
140103110403973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 37.
The spelling of 140103110403973 in words is "one hundred forty trillion, one hundred three billion, one hundred ten million, four hundred three thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •