Base | Representation |
---|---|
bin | 100000001010001000000100… |
… | …000001010110011001000000 |
3 | 200112202220011200022020102010 |
4 | 200022020010001112121000 |
5 | 122014220440133120000 |
6 | 1220445325112452520 |
7 | 41535136011502254 |
oct | 4012100401263100 |
9 | 615686150266363 |
10 | 141433340520000 |
11 | 410795a76226a1 |
12 | 13a4288b6aa140 |
13 | 60bc1507ab0c9 |
14 | 26cd5a5868264 |
15 | 115401467dd50 |
hex | 80a204056640 |
141433340520000 has 140 divisors (see below), whose sum is σ = 467611625268656. Its totient is φ = 37715557440000.
The previous prime is 141433340519971. The next prime is 141433340520019. The reversal of 141433340520000 is 25043334141.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a self number, because there is not a number n which added to its sum of digits gives 141433340520000.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 589185586 + ... + 589425585.
Almost surely, 2141433340520000 is an apocalyptic number.
141433340520000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141433340520000 is an abundant number, since it is smaller than the sum of its proper divisors (326178284748656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141433340520000 is an equidigital number, since it uses as much as digits as its factorization.
141433340520000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1178611206 (or 1178611181 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 141433340520000 its reverse (25043334141), we get a palindrome (141458383854141).
The spelling of 141433340520000 in words is "one hundred forty-one trillion, four hundred thirty-three billion, three hundred forty million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •