Base | Representation |
---|---|
bin | 1000001111010010100… |
… | …1010000100111011100 |
3 | 111112100101220020102201 |
4 | 2003310221100213130 |
5 | 4304340103111030 |
6 | 145005114301244 |
7 | 13140402064216 |
oct | 2036451204734 |
9 | 445311806381 |
10 | 141543410140 |
11 | 55034624010 |
12 | 23522727824 |
13 | 10469573032 |
14 | 6bca5d15b6 |
15 | 3a364932ca |
hex | 20f4a509dc |
141543410140 has 48 divisors (see below), whose sum is σ = 330381283680. Its totient is φ = 50499188480.
The previous prime is 141543410119. The next prime is 141543410179. The reversal of 141543410140 is 41014345141.
It is a junction number, because it is equal to n+sod(n) for n = 141543410099 and 141543410108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6057955 + ... + 6081274.
It is an arithmetic number, because the mean of its divisors is an integer number (6882943410).
Almost surely, 2141543410140 is an apocalyptic number.
141543410140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141543410140 is an abundant number, since it is smaller than the sum of its proper divisors (188837873540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141543410140 is a wasteful number, since it uses less digits than its factorization.
141543410140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12139302 (or 12139300 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 141543410140 its reverse (41014345141), we get a palindrome (182557755281).
The spelling of 141543410140 in words is "one hundred forty-one billion, five hundred forty-three million, four hundred ten thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •