Base | Representation |
---|---|
bin | 1000001100101100011… |
… | …1001110000111010101 |
3 | 111110112211202200121202 |
4 | 2003023013032013111 |
5 | 4301423213334031 |
6 | 144412023522245 |
7 | 13114211345342 |
oct | 2031307160725 |
9 | 443484680552 |
10 | 140846621141 |
11 | 54807278136 |
12 | 233692b9385 |
13 | 103880b9355 |
14 | 6b61c517c9 |
15 | 39e52072cb |
hex | 20cb1ce1d5 |
140846621141 has 4 divisors (see below), whose sum is σ = 140849642892. Its totient is φ = 140843599392.
The previous prime is 140846621129. The next prime is 140846621143. The reversal of 140846621141 is 141126648041.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25617603025 + 115229018116 = 160055^2 + 339454^2 .
It is a cyclic number.
It is not a de Polignac number, because 140846621141 - 214 = 140846604757 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 140846621095 and 140846621104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140846621143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1439846 + ... + 1534551.
It is an arithmetic number, because the mean of its divisors is an integer number (35212410723).
Almost surely, 2140846621141 is an apocalyptic number.
It is an amenable number.
140846621141 is a deficient number, since it is larger than the sum of its proper divisors (3021751).
140846621141 is an equidigital number, since it uses as much as digits as its factorization.
140846621141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3021750.
The product of its (nonzero) digits is 36864, while the sum is 38.
The spelling of 140846621141 in words is "one hundred forty billion, eight hundred forty-six million, six hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •