Base | Representation |
---|---|
bin | 1000001101101011110… |
… | …0000100001011010000 |
3 | 111111020100101001110112 |
4 | 2003122330010023100 |
5 | 4302444201213204 |
6 | 144454230420452 |
7 | 13123614222353 |
oct | 2033274041320 |
9 | 444210331415 |
10 | 141112132304 |
11 | 54933135650 |
12 | 23422201728 |
13 | 103cb0ccc50 |
14 | 6b8920829a |
15 | 3a0d6a226e |
hex | 20daf042d0 |
141112132304 has 160 divisors (see below), whose sum is σ = 329258926080. Its totient is φ = 57739046400.
The previous prime is 141112132279. The next prime is 141112132351. The reversal of 141112132304 is 403231211141.
It is a self number, because there is not a number n which added to its sum of digits gives 141112132304.
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, 17139869 + ... + 17148099.
It is an arithmetic number, because the mean of its divisors is an integer number (2057868288).
Almost surely, 2141112132304 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 141112132304, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164629463040).
141112132304 is an abundant number, since it is smaller than the sum of its proper divisors (188146793776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141112132304 is a wasteful number, since it uses less digits than its factorization.
141112132304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8449 (or 8443 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 141112132304 its reverse (403231211141), we get a palindrome (544343343445).
The spelling of 141112132304 in words is "one hundred forty-one billion, one hundred twelve million, one hundred thirty-two thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •