Base | Representation |
---|---|
bin | 10000110100000… |
… | …11111110011101 |
3 | 100211102001220002 |
4 | 20122003332131 |
5 | 242102043012 |
6 | 21555104045 |
7 | 3331621532 |
oct | 1032037635 |
9 | 324361802 |
10 | 141049757 |
11 | 72689852 |
12 | 3b2a2025 |
13 | 232b70c4 |
14 | 14a38d89 |
15 | c5b27c2 |
hex | 8683f9d |
141049757 has 2 divisors, whose sum is σ = 141049758. Its totient is φ = 141049756.
The previous prime is 141049739. The next prime is 141049771. The reversal of 141049757 is 757940141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79049881 + 61999876 = 8891^2 + 7874^2 .
It is a cyclic number.
It is not a de Polignac number, because 141049757 - 218 = 140787613 is a prime.
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 141049757.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (141049157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70524878 + 70524879.
It is an arithmetic number, because the mean of its divisors is an integer number (70524879).
Almost surely, 2141049757 is an apocalyptic number.
It is an amenable number.
141049757 is a deficient number, since it is larger than the sum of its proper divisors (1).
141049757 is an equidigital number, since it uses as much as digits as its factorization.
141049757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35280, while the sum is 38.
The square root of 141049757 is about 11876.4370498900. The cubic root of 141049757 is about 520.5440029264.
Adding to 141049757 its reverse (757940141), we get a palindrome (898989898).
The spelling of 141049757 in words is "one hundred forty-one million, forty-nine thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •