Base | Representation |
---|---|
bin | 1000001111101010001… |
… | …1000000001010011100 |
3 | 111112121022020010111201 |
4 | 2003322203000022130 |
5 | 4310040430330210 |
6 | 145023012525244 |
7 | 13143013550143 |
oct | 2037243001234 |
9 | 445538203451 |
10 | 141642433180 |
11 | 55085508536 |
12 | 2354b920824 |
13 | 10483c33c51 |
14 | 6bd980a75a |
15 | 3a4000353a |
hex | 20fa8c029c |
141642433180 has 96 divisors (see below), whose sum is σ = 313744233600. Its totient is φ = 53608439808.
The previous prime is 141642433169. The next prime is 141642433181. The reversal of 141642433180 is 81334246141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141642433181) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29574226 + ... + 29579014.
It is an arithmetic number, because the mean of its divisors is an integer number (3268169100).
Almost surely, 2141642433180 is an apocalyptic number.
141642433180 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 141642433180, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156872116800).
141642433180 is an abundant number, since it is smaller than the sum of its proper divisors (172101800420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141642433180 is a wasteful number, since it uses less digits than its factorization.
141642433180 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5503 (or 5501 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 37.
The spelling of 141642433180 in words is "one hundred forty-one billion, six hundred forty-two million, four hundred thirty-three thousand, one hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •