Base | Representation |
---|---|
bin | 11111110111000011111011… |
… | …111100111010000000000101 |
3 | 200101010122120112020220100201 |
4 | 133313003323330322000011 |
5 | 121331234343432042013 |
6 | 1214003421114210501 |
7 | 41341366341664405 |
oct | 3767037374720005 |
9 | 611118515226321 |
10 | 140123240112133 |
11 | 40713a29046593 |
12 | 138709a5723a31 |
13 | 6025745c6c185 |
14 | 2686002aa0805 |
15 | 112edd8b653dd |
hex | 7f70fbf3a005 |
140123240112133 has 2 divisors, whose sum is σ = 140123240112134. Its totient is φ = 140123240112132.
The previous prime is 140123240112001. The next prime is 140123240112169. The reversal of 140123240112133 is 331211042321041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138292355089729 + 1830885022404 = 11759777^2 + 1353102^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140123240112133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140123240112533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70061620056066 + 70061620056067.
It is an arithmetic number, because the mean of its divisors is an integer number (70061620056067).
Almost surely, 2140123240112133 is an apocalyptic number.
It is an amenable number.
140123240112133 is a deficient number, since it is larger than the sum of its proper divisors (1).
140123240112133 is an equidigital number, since it uses as much as digits as its factorization.
140123240112133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 140123240112133 its reverse (331211042321041), we get a palindrome (471334282433174).
The spelling of 140123240112133 in words is "one hundred forty trillion, one hundred twenty-three billion, two hundred forty million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •