Base | Representation |
---|---|
bin | 100000000110111001010001… |
… | …110010000111000100111000 |
3 | 200111222200001202210001220211 |
4 | 200012321101302013010320 |
5 | 122002101224023123233 |
6 | 1220155325004400504 |
7 | 41513115552440155 |
oct | 4006712162070470 |
9 | 614880052701824 |
10 | 141211306848568 |
11 | 40aa3419387a90 |
12 | 13a07844b46134 |
13 | 60a422767ab38 |
14 | 26c294135d22c |
15 | 114d36bb795cd |
hex | 806e51c87138 |
141211306848568 has 32 divisors (see below), whose sum is σ = 298158771064320. Its totient is φ = 62116410636000.
The previous prime is 141211306848517. The next prime is 141211306848569. The reversal of 141211306848568 is 865848603112141.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141211306848569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25881835038 + ... + 25881840493.
It is an arithmetic number, because the mean of its divisors is an integer number (9317461595760).
Almost surely, 2141211306848568 is an apocalyptic number.
It is an amenable number.
141211306848568 is an abundant number, since it is smaller than the sum of its proper divisors (156947464215752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141211306848568 is a wasteful number, since it uses less digits than its factorization.
141211306848568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51763675579 (or 51763675575 counting only the distinct ones).
The product of its (nonzero) digits is 8847360, while the sum is 58.
The spelling of 141211306848568 in words is "one hundred forty-one trillion, two hundred eleven billion, three hundred six million, eight hundred forty-eight thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •