Base | Representation |
---|---|
bin | 10000110101000… |
… | …10101101101101 |
3 | 100211122110121012 |
4 | 20122202231231 |
5 | 242120110121 |
6 | 22001515005 |
7 | 3332654564 |
oct | 1032425555 |
9 | 324573535 |
10 | 141175661 |
11 | 72765400 |
12 | 3b342a65 |
13 | 2332c4c3 |
14 | 14a6cbdb |
15 | c5d9c5b |
hex | 86a2b6d |
141175661 has 6 divisors (see below), whose sum is σ = 155176686. Its totient is φ = 128341400.
The previous prime is 141175637. The next prime is 141175663. The reversal of 141175661 is 166571141.
141175661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 140873161 + 302500 = 11869^2 + 550^2 .
It is not a de Polignac number, because 141175661 - 26 = 141175597 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141175663) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 583250 + ... + 583491.
It is an arithmetic number, because the mean of its divisors is an integer number (25862781).
Almost surely, 2141175661 is an apocalyptic number.
141175661 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
141175661 is a deficient number, since it is larger than the sum of its proper divisors (14001025).
141175661 is a wasteful number, since it uses less digits than its factorization.
141175661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1166763 (or 1166752 counting only the distinct ones).
The product of its digits is 5040, while the sum is 32.
The square root of 141175661 is about 11881.7364471697. The cubic root of 141175661 is about 520.6988397320.
The spelling of 141175661 in words is "one hundred forty-one million, one hundred seventy-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •