Base | Representation |
---|---|
bin | 100000000101101101110111… |
… | …110110101011000010000000 |
3 | 200111200221002010121222010002 |
4 | 200011231313312223002000 |
5 | 121444234414321400000 |
6 | 1220054214513455132 |
7 | 41504221263665465 |
oct | 4005556766530200 |
9 | 614627063558102 |
10 | 141130341200000 |
11 | 40a7205038a939 |
12 | 139b40098714a8 |
13 | 60996c3475649 |
14 | 26bca6025966c |
15 | 114b1cda128d5 |
hex | 805b77dab080 |
141130341200000 has 96 divisors (see below), whose sum is σ = 351425135359620. Its totient is φ = 56452136320000.
The previous prime is 141130341199999. The next prime is 141130341200059. The reversal of 141130341200000 is 2143031141.
It can be written as a sum of positive squares in 6 ways, for example, as 606766218304 + 140523574981696 = 778952^2 + 11854264^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 176012927 + ... + 176812926.
Almost surely, 2141130341200000 is an apocalyptic number.
141130341200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141130341200000 is an abundant number, since it is smaller than the sum of its proper divisors (210294794159620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141130341200000 is an frugal number, since it uses more digits than its factorization.
141130341200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352825892 (or 352825860 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 141130341200000 its reverse (2143031141), we get a palindrome (141132484231141).
The spelling of 141130341200000 in words is "one hundred forty-one trillion, one hundred thirty billion, three hundred forty-one million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •