Base | Representation |
---|---|
bin | 100000001011011010000010… |
… | …011110000000011100000000 |
3 | 200120002022100222221112020210 |
4 | 200023122002132000130000 |
5 | 122022141221443314032 |
6 | 1220554003231434120 |
7 | 41544403156032543 |
oct | 4013320236003400 |
9 | 616068328845223 |
10 | 141521361307392 |
11 | 41102966004a90 |
12 | 13a57955685940 |
13 | 60c753a553961 |
14 | 26d395595c85a |
15 | 1156466da22cc |
hex | 80b682780700 |
141521361307392 has 72 divisors (see below), whose sum is σ = 410894407002240. Its totient is φ = 42885260999680.
The previous prime is 141521361307367. The next prime is 141521361307393. The reversal of 141521361307392 is 293703163125141.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141521361307393) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8376019092 + ... + 8376035987.
It is an arithmetic number, because the mean of its divisors is an integer number (5706866763920).
Almost surely, 2141521361307392 is an apocalyptic number.
141521361307392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
141521361307392 is an abundant number, since it is smaller than the sum of its proper divisors (269373045694848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141521361307392 is a wasteful number, since it uses less digits than its factorization.
141521361307392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16752055109 (or 16752055095 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 48.
The spelling of 141521361307392 in words is "one hundred forty-one trillion, five hundred twenty-one billion, three hundred sixty-one million, three hundred seven thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •