Base | Representation |
---|---|
bin | 1000001100111001011… |
… | …1010110001000100101 |
3 | 111110200122102120020001 |
4 | 2003032113112020211 |
5 | 4302031200224231 |
6 | 144421253141301 |
7 | 13115443161034 |
oct | 2031627261045 |
9 | 443618376201 |
10 | 140901179941 |
11 | 54835051a55 |
12 | 2338362a831 |
13 | 103964ac772 |
14 | 6b691b471b |
15 | 39e9dd2b61 |
hex | 20ce5d6225 |
140901179941 has 2 divisors, whose sum is σ = 140901179942. Its totient is φ = 140901179940.
The previous prime is 140901179929. The next prime is 140901179953. The reversal of 140901179941 is 149971109041.
It is a balanced prime because it is at equal distance from previous prime (140901179929) and next prime (140901179953).
It can be written as a sum of positive squares in only one way, i.e., 139225996900 + 1675183041 = 373130^2 + 40929^2 .
It is a cyclic number.
It is not a de Polignac number, because 140901179941 - 219 = 140900655653 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140901179891 and 140901179900.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140901179981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70450589970 + 70450589971.
It is an arithmetic number, because the mean of its divisors is an integer number (70450589971).
Almost surely, 2140901179941 is an apocalyptic number.
It is an amenable number.
140901179941 is a deficient number, since it is larger than the sum of its proper divisors (1).
140901179941 is an equidigital number, since it uses as much as digits as its factorization.
140901179941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 46.
The spelling of 140901179941 in words is "one hundred forty billion, nine hundred one million, one hundred seventy-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •