Base | Representation |
---|---|
bin | 10000111001011… |
… | …10011000100101 |
3 | 100212201112100122 |
4 | 20130232120211 |
5 | 242241411444 |
6 | 22022051325 |
7 | 3340556513 |
oct | 1034563045 |
9 | 325645318 |
10 | 141747749 |
11 | 73016200 |
12 | 3b579b45 |
13 | 2349ca10 |
14 | 14b7b4b3 |
15 | c69e4ee |
hex | 872e625 |
141747749 has 24 divisors (see below), whose sum is σ = 169702680. Its totient is φ = 117596160.
The previous prime is 141747731. The next prime is 141747769. The reversal of 141747749 is 947747141.
It can be written as a sum of positive squares in 4 ways, for example, as 3214849 + 138532900 = 1793^2 + 11770^2 .
It is not a de Polignac number, because 141747749 - 212 = 141743653 is a prime.
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141747709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 152117 + ... + 153045.
It is an arithmetic number, because the mean of its divisors is an integer number (7070945).
Almost surely, 2141747749 is an apocalyptic number.
It is an amenable number.
141747749 is a deficient number, since it is larger than the sum of its proper divisors (27954931).
141747749 is a wasteful number, since it uses less digits than its factorization.
141747749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1061 (or 1050 counting only the distinct ones).
The product of its digits is 197568, while the sum is 44.
The square root of 141747749 is about 11905.7863663011. The cubic root of 141747749 is about 521.4012367409.
The spelling of 141747749 in words is "one hundred forty-one million, seven hundred forty-seven thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •