Base | Representation |
---|---|
bin | 10000101101010… |
… | …11000001100001 |
3 | 100202201220220122 |
4 | 20112223001201 |
5 | 241340123441 |
6 | 21524050025 |
7 | 3321231002 |
oct | 1026530141 |
9 | 322656818 |
10 | 140161121 |
11 | 72132141 |
12 | 3ab33915 |
13 | 23065799 |
14 | 148871a9 |
15 | c48934b |
hex | 85ab061 |
140161121 has 4 divisors (see below), whose sum is σ = 140558532. Its totient is φ = 139763712.
The previous prime is 140161111. The next prime is 140161183. The reversal of 140161121 is 121161041.
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 53875600 + 86285521 = 7340^2 + 9289^2 .
It is a cyclic number.
It is not a de Polignac number, because 140161121 - 214 = 140144737 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 140161121.
It is not an unprimeable number, because it can be changed into a prime (140161111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 198176 + ... + 198881.
It is an arithmetic number, because the mean of its divisors is an integer number (35139633).
Almost surely, 2140161121 is an apocalyptic number.
It is an amenable number.
140161121 is a deficient number, since it is larger than the sum of its proper divisors (397411).
140161121 is an equidigital number, since it uses as much as digits as its factorization.
140161121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397410.
The product of its (nonzero) digits is 48, while the sum is 17.
The square root of 140161121 is about 11838.9662133144. The cubic root of 140161121 is about 519.4485290189.
The spelling of 140161121 in words is "one hundred forty million, one hundred sixty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •