Base | Representation |
---|---|
bin | 10000110100011… |
… | …00000010011000 |
3 | 100211110202012000 |
4 | 20122030002120 |
5 | 242104122101 |
6 | 21555521000 |
7 | 3332120022 |
oct | 1032140230 |
9 | 324422160 |
10 | 141082776 |
11 | 7270163a |
12 | 3b2b9160 |
13 | 232c9143 |
14 | 14a47012 |
15 | c5bc486 |
hex | 868c098 |
141082776 has 128 divisors (see below), whose sum is σ = 408576000. Its totient is φ = 45069696.
The previous prime is 141082757. The next prime is 141082789. The reversal of 141082776 is 677280141.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 141082776.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1014915 + ... + 1015053.
It is an arithmetic number, because the mean of its divisors is an integer number (3192000).
Almost surely, 2141082776 is an apocalyptic number.
141082776 is the 6858-th octagonal number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 141082776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204288000).
141082776 is an abundant number, since it is smaller than the sum of its proper divisors (267493224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141082776 is a wasteful number, since it uses less digits than its factorization.
141082776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318 (or 308 counting only the distinct ones).
The product of its (nonzero) digits is 18816, while the sum is 36.
The square root of 141082776 is about 11877.8270740064. The cubic root of 141082776 is about 520.5846186206.
The spelling of 141082776 in words is "one hundred forty-one million, eighty-two thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •