Base | Representation |
---|---|
bin | 10000101111110… |
… | …11000110001101 |
3 | 100210100120211001 |
4 | 20113323012031 |
5 | 241431122401 |
6 | 21535100301 |
7 | 3324065134 |
oct | 1027730615 |
9 | 323316731 |
10 | 140489101 |
11 | 723365a5 |
12 | 3b071691 |
13 | 2314bb5c |
14 | 1493091b |
15 | c501601 |
hex | 85fb18d |
140489101 has 2 divisors, whose sum is σ = 140489102. Its totient is φ = 140489100.
The previous prime is 140489099. The next prime is 140489113. The reversal of 140489101 is 101984041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85581001 + 54908100 = 9251^2 + 7410^2 .
It is a cyclic number.
It is not a de Polignac number, because 140489101 - 21 = 140489099 is a prime.
Together with 140489099, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 140489101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140489131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70244550 + 70244551.
It is an arithmetic number, because the mean of its divisors is an integer number (70244551).
Almost surely, 2140489101 is an apocalyptic number.
It is an amenable number.
140489101 is a deficient number, since it is larger than the sum of its proper divisors (1).
140489101 is an equidigital number, since it uses as much as digits as its factorization.
140489101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 28.
The square root of 140489101 is about 11852.8098356466. The cubic root of 140489101 is about 519.8533869210.
The spelling of 140489101 in words is "one hundred forty million, four hundred eighty-nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •